A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics

We introduce the first complete and approximately universal diagrammatic language for quantum mechanics. We make the ZX-Calculus, a diagrammatic language introduced by Coecke and Duncan, complete for the so-called Clifford+T quantum mechanics by adding two new axioms to the language. The completeness of the ZX-Calculus for Clifford+T quantum mechanics -- also called the π/4-fragment of the ZX-Calculus -- was one of the main open questions in categorical quantum mechanics. We prove the completeness of this fragment using the recently studied ZW-Calculus, a calculus dealing with integer matrices. We also prove that the π/4-fragment of the ZX-Calculus represents exactly all the matrices over some finite dimensional extension of the ring of dyadic rationals.

[1]  Peter Selinger,et al.  Exact synthesis of multi-qubit Clifford+T circuits , 2012, ArXiv.

[2]  Miriam Backens,et al.  The ZX-calculus is complete for the single-qubit Clifford+T group , 2014, 1412.8553.

[3]  Stefan Zohren,et al.  Graphical structures for design and verification of quantum error correction , 2016, Quantum Science and Technology.

[4]  Simon Perdrix,et al.  ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics , 2017, MFCS.

[5]  Aleks Kissinger,et al.  Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , 2017 .

[6]  Simon Perdrix,et al.  Rewriting Measurement-Based Quantum Computations with Generalised Flow , 2010, ICALP.

[7]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..

[8]  Dominic Horsman,et al.  Quantum picturalism for topological cluster-state computing , 2011, 1101.4722.

[9]  Ross Duncan,et al.  Interacting Frobenius Algebras are Hopf , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[10]  Ross Duncan,et al.  A graphical approach to measurement-based quantum computing , 2012, Quantum Physics and Linguistics.

[11]  Simon Perdrix,et al.  Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics , 2018, LICS.

[12]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[13]  Miriam Backens,et al.  The ZX-calculus is complete for stabilizer quantum mechanics , 2013, 1307.7025.

[14]  Miriam Backens,et al.  A Complete Graphical Calculus for Spekkens’ Toy Bit Theory , 2014, 1411.1618.

[15]  Simon Perdrix,et al.  Towards a Minimal Stabilizer ZX-calculus , 2017, Log. Methods Comput. Sci..

[16]  Vladimir Zamdzhiev,et al.  The ZX calculus is incomplete for quantum mechanics , 2014, QPL.

[17]  Amar Hadzihasanovic,et al.  The algebra of entanglement and the geometry of composition , 2017, ArXiv.

[18]  Ross Duncan,et al.  Verifying the Steane code with Quantomatic , 2013, QPL.

[19]  Simon Perdrix,et al.  Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive , 2017, ArXiv.

[20]  Aleks Kissinger,et al.  The Compositional Structure of Multipartite Quantum Entanglement , 2010, ICALP.

[21]  Ross Duncan,et al.  Verifying the Smallest Interesting Colour Code with Quantomatic , 2017, QPL.

[22]  Bob Coecke,et al.  Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.

[23]  A. Azzouz.  2011 , 2020, City.

[24]  Quanlong Wang,et al.  Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics , 2018, 1801.07993.

[25]  Simon Perdrix,et al.  A Simplified Stabilizer ZX-calculus , 2016, QPL.

[26]  Dominic Horsman,et al.  The ZX calculus is a language for surface code lattice surgery , 2017, Quantum.

[27]  Aleks Kissinger,et al.  Quantomatic: A proof assistant for diagrammatic reasoning , 2015, CADE.

[28]  Quanlong Wang,et al.  A universal completion of the ZX-calculus , 2017, ArXiv.

[29]  Simon Perdrix,et al.  Supplementarity is Necessary for Quantum Diagram Reasoning , 2015, MFCS.

[30]  Simon Perdrix,et al.  Completeness of the ZX-Calculus , 2019, Log. Methods Comput. Sci..

[31]  Simon Perdrix,et al.  Pivoting makes the ZX-calculus complete for real stabilizers , 2013, QPL.

[32]  Amar Hadzihasanovic,et al.  A Diagrammatic Axiomatisation for Qubit Entanglement , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.