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

DOI10.1145/3209108.3209131MaRDI QIDQ5145332zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.11151

zbMATH Keywords

completeness categorical quantum mechanics Clifford+T ZX-calculus

Mathematics Subject Classification ID

Quantum computation (81P68) String diagrams and graphical calculi (18M30) Quantum gates (81P65) Applications of Clifford algebras to physics, etc. (15A67)

Abstract: We introduce the first complete and approximatively 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 four new axioms to the language. The completeness of the ZX-Calculus for Clifford+T quantum mechanics was one of the main open questions in categorical quantum mechanics. We prove the completeness of the Clifford+T fragment of the ZX-Calculus using the recently studied ZW-Calculus, a calculus dealing with integer matrices. We also prove that the Clifford+T fragment of the ZX-Calculus represents exactly all the matrices over some finite dimensional extension of the ring of dyadic rationals.

Recommendations

Cited in

(39)

This page was built for publication: A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145332)