Supplementarity is Necessary for Quantum Diagram Reasoning
arXiv:1506.03055 · doi:10.4230/LIPIcs.MFCS.2016.76
Abstract
The ZX-calculus is a powerful diagrammatic language for quantum mechanics and quantum information processing. We prove that its π/4-fragment is not complete, in other words the ZX-calculus is not complete for the so called "Clifford+T quantum mechanics". The completeness of this fragment was one of the main open problems in categorical quantum mechanics, a programme initiated by Abramsky and Coecke. The ZX-calculus was known to be incomplete for quantum mechanics. On the other hand, its π/2-fragment is known to be complete, i.e. the ZX-calculus is complete for the so called "stabilizer quantum mechanics". Deciding whether its π/4-fragment is complete is a crucial step in the development of the ZX-calculus since this fragment is approximately universal for quantum mechanics, contrary to the π/2-fragment. To establish our incompleteness result, we consider a fairly simple property of quantum states called supplementarity. We show that supplementarity can be derived in the ZX-calculus if and only if the angles involved in this equation are multiples of π/2. In particular, the impossibility to derive supplementarity for π/4 implies the incompleteness of the ZX-calculus for Clifford+T quantum mechanics. As a consequence, we propose to add the supplementarity to the set of rules of the ZX-calculus. We also show that if a ZX-diagram involves antiphase twins, they can be merged when the ZX-calculus is augmented with the supplementarity rule. Merging antiphase twins makes diagrammatic reasoning much easier and provides a purely graphical meaning to the supplementarity rule.
Generalised proof and graphical interpretation. 16 pages, submitted
References in corpus (1)
Cited by in corpus (9)
- Optimising Clifford Circuits with Quantomatic
- Verifying the Smallest Interesting Colour Code with Quantomatic
- A Simplified Stabilizer ZX-calculus
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Y-Calculus: A Language for Real Matrices Derived from the ZX-Calculus
- Well-tempered ZX and ZH Calculi
- Optimal compilation of parametrised quantum circuits
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)