A Simplified Stabilizer ZX-calculus
arXiv:1602.04744 · doi:10.4204/EPTCS.236.1
Abstract
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics.The language is sound and complete: a stabilizer ZX-diagram can be transformed into another one if and only if these two diagrams represent the same quantum evolution or quantum state. We show that the stabilizer ZX-calculus can be simplified, removing unnecessary equations while keeping only the essential axioms which potentially capture fundamental structures of quantum mechanics. We thus give a significantly smaller set of axioms and prove that meta-rules like 'colour symmetry' and 'upside-down symmetry', which were considered as axioms in previous versions of the language, can in fact be derived. In particular, we show that the additional symbol and one of the rules which had been recently introduced to keep track of scalars (diagrams with no inputs or outputs) are not necessary.
In Proceedings QPL 2016, arXiv:1701.00242
References in corpus (3)
Cited by in corpus (13)
- Formal Verification of Quantum Programs: Theory, Tools and Challenges
- Optimising Clifford Circuits with Quantomatic
- Verifying the Smallest Interesting Colour Code with Quantomatic
- A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
- A Pair Measurement Surface Code on Pentagons
- A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- The Category CNOT
- An Algebraic Axiomatisation of ZX-calculus
- Well-tempered ZX and ZH Calculi
- Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
- String Diagrams for Defect-Based Surface Code Computing
- A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra