A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
arXiv:1804.03084 · doi:10.4204/EPTCS.287.18
Abstract
We consider a ZX-calculus augmented with triangle nodes which is well-suited to reason on the so-called Toffoli-Hadamard fragment of quantum mechanics. We precisely show the form of the matrices it represents, and we provide an axiomatisation which makes the language complete for the Toffoli-Hadamard quantum mechanics. We extend the language with arbitrary angles and show that any true equation involving linear diagrams which constant angles are multiple of Pi are derivable. We show that a single axiom is then necessary and sufficient to make the language equivalent to the ZX-calculus which is known to be complete for Clifford+T quantum mechanics. As a by-product, it leads to a new and simple complete axiomatisation for Clifford+T quantum mechanics.
arXiv commentIn Proceedings QPL 2018, arXiv:1901.09476. Contains Appendix
References in corpus (16)
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Quantum circuits of T-depth one
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- The ZX-calculus is complete for stabilizer quantum mechanics
- The ZX calculus is a language for surface code lattice surgery
- Pivoting makes the ZX-calculus complete for real stabilizers
- A universal completion of the ZX-calculus
- Verifying the Steane code with Quantomatic
- The ZX-calculus is complete for the single-qubit Clifford+T group
- The algebra of entanglement and the geometry of composition
- Quantomatic: A Proof Assistant for Diagrammatic Reasoning
- Quantum picturalism for topological cluster-state computing
- Graphical Structures for Design and Verification of Quantum Error Correction
- A Simplified Stabilizer ZX-calculus
- Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics
- The Category TOF
Cited by in corpus (14)
- ZX-calculus for the working quantum computer scientist
- Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits
- Completeness of the ZX-Calculus
- The Category TOF
- Completeness of the ZH-calculus
- When Only Topology Matters
- Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions
- Completeness of the Phase-free ZH-calculus
- Generators and Relations for Real Stabilizer Operators
- Well-tempered ZX and ZH Calculi
- Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
- Tian's partial -estimate implies Hamilton-Tian's conjecture
- A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits
- A Graphical #SAT Algorithm for Formulae with Small Clause Density