Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation

Abstract

The “Sum-Over-Paths” formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that it is complete for “Toffoli-Hadamard”, the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-Calculus, and also show how the axiomatisation translates into the latter. Finally, we show how to enrich the rewrite system to reach completeness for the dyadic fragments of quantum computation – obtained by adding phase gates with dyadic multiples of π to the Toffoli-Hadamard gate-set – used in particular in the Quantum Fourier Transform.
Fichier principal
Vignette du fichier
SOP-TH.pdf (868.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03654438 , version 1 (28-04-2022)
hal-03654438 , version 2 (11-01-2023)

Identifiers

Cite

Renaud Vilmart. Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. CSL 2023 - 31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩. ⟨hal-03654438v2⟩
141 View
152 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More