[논문 리뷰] Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation

Renaud Vilmart|arXiv (Cornell University)|2022. 05. 05.

Logic, programming, and type systems인용 수 6

한 줄 요약

이 논문은 양자 계산의 Toffoli-Hadamard 조각에서 Sum-Over-Paths (SOP) 형식주의에 대한 완전한 방정정식 이론을 제시하며, 비연결성과 잠재적 용량 폭발에도 불구하고 완전성을 달성하는 새로운 재작성 시스템을 도입한다. 이 시스템은 1/√2의 홀수 거듭제곱을 다룰 수 있도록 단일 핵심 재작성 규칙을 추가하여 전체 이진 조각(dyadic fragment)으로 확장된다. 또한 함자적 번역을 통해 SOP와 ZH-계산법 사이의 대응 관계를 수립하여 양자 회로의 그림적 추론과 단순화를 가능하게 한다.

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.

연구 동기 및 목표

• To develop a complete equational theory for the Toffoli-Hadamard fragment within the Sum-Over-Paths (SOP) formalism.
• To extend completeness to the broader dyadic fragments of quantum computation, including phase gates with dyadic multiples of π.
• To establish a functorial correspondence between SOP and ZH-Calculus, enabling graphical interpretation of SOP rewrite rules.
• To address the limitations of non-confluence and exponential term growth in SOP rewriting, while preserving semantic equivalence.

제안 방법

• Introduces a new set of rewrite rules for SOP that are terminating but not confluent, tailored for the Toffoli-Hadamard fragment.
• Uses a functor ↿⌊·⌋↾k to project SOP terms into a lower-resolution fragment (1/2^k) to enable inductive completeness proofs.
• Defines a reverse functor ⇃⌈·⌉⇂k to reconstruct higher-resolution terms, enabling completeness transfer across levels.
• Extends the rewrite system with a single rule (√2 rule) to handle terms with odd powers of 1/√2, enabling completeness for the full dyadic fragment.
• Translates SOP rewrite rules into equivalent ZH-Calculus identities, showing that rules like (HHnl) and (HHgen) correspond to known graphical identities.
• Employs a recursive completeness argument: completeness in the base fragment (1/2) implies completeness in higher fragments via the functors and their inverses.

실험 결과

연구 질문

• RQ1 Can a complete equational theory be established for the Toffoli-Hadamard fragment using the Sum-Over-Paths formalism, despite its non-confluent nature?
• RQ2 How can the rewrite system be extended to achieve completeness for the full dyadic fragment of quantum computation, including phase gates with dyadic multiples of π?
• RQ3 What is the precise correspondence between SOP rewrite rules and identities in the ZH-Calculus, and how can this be used to interpret and verify quantum circuit equivalences?
• RQ4 Can the completeness result be lifted from low-resolution fragments (1/2^k) to the full dyadic fragment using functorial translations?

주요 결과

• The paper establishes completeness of the SOP formalism for the Toffoli-Hadamard fragment using a new rewrite system, proving that two terms are semantically equal if and only if they are derivable from one another via the equational theory ∼TH.
• Completeness is extended to the entire dyadic fragment by adding a single rewrite rule: the √2 rule, which transforms terms with phase 1/8 + 3/4 y0 into terms with a scalar factor of √2, enabling equivalence between terms with different scalar powers of 1/√2.
• The functor ↿⌊·⌋↾k preserves semantics and allows inductive completeness proofs by reducing high-resolution terms to lower-resolution ones, where completeness is already known.
• The reverse functor ⇃⌈·⌉⇂k reconstructs higher-resolution terms and ensures that semantic equivalence at lower levels lifts back to the original level, proving the completeness of the extended theory ∼TH’.
• The correspondence between SOP and ZH-Calculus is formally established: rewrite rules in SOP correspond to known graphical identities in ZH, enabling visual reasoning and simplification.
• The paper demonstrates that while the rewrite system is not confluent and may cause exponential term growth, it is sufficient for completeness, and the trade-off is inherent to the universality of the fragment.