Diagrammatic reasoning beyond Clifford+T quantum mechanics

DOI10.1145/3209108.3209139zbMATH Open1452.81081DBLPconf/lics/JeandelPV18aarXiv1801.10142OpenAlexW2963618180WikidataQ64356751 ScholiaQ64356751MaRDI QIDQ5145333FDOQ5145333

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)

Abstract: The ZX-Calculus is a graphical language for quantum mechanics. An axiomatisation has recently been proven to be complete for an approximatively universal fragment of quantum mechanics, the so-called Clifford+T fragment. We focus here on the expressive power of this axiomatisation beyond Clifford+T Quantum mechanics. We consider the full pure qubit quantum mechanics, and mainly prove two results: (i) First, the axiomatisation for Clifford+T quantum mechanics is also complete for all equations involving some kind of linear diagrams. The linearity of the diagrams reflects the phase group structure, an essential feature of the ZX-calculus. In particular all the axioms of the ZX-calculus are involving linear diagrams. (ii) We also show that the axiomatisation for Clifford+T is not complete in general but can be completed by adding a single (non linear) axiom, providing a simpler axiomatisation of the ZX-calculus for pure quantum mechanics than the one recently introduced by Ng&Wang.

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

Recommendations

• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
• ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
• Two complete axiomatisations of pure-state qubit quantum computing
• scientific article
• Supplementarity is necessary for quantum diagram reasoning

zbMATH Keywords

completenesscategorical quantum mechanicsgraphical calculusZX-calculus

Mathematics Subject Classification ID

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

Cited In (26)

• Addition and differentiation of ZX-diagrams
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimising Clifford circuits with quantomatic
• ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
• Y-calculus: a language for real matrices derived from the ZX-calculus
• Quantum algorithms and oracles with the scalable ZX-calculus
• Supplementarity is necessary for quantum diagram reasoning
• A diagrammatic axiomatisation for qubit entanglement
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• Light-Matter Interaction in the ZXW Calculus
• Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
• ZX-rules for 2-qubit \(\text{2-qubit Clifford}+\text{T}\) quantum circuits
• And-gates in ZX-calculus: spider nest identities and QBC-completeness
• An algebraic axiomatisation of ZX-calculus
• A diagrammatic axiomatisation of fermionic quantum circuits
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• The ZX-calculus is complete for the single-qubit Clifford+T group
• A generic normal form for ZX-diagrams and application to the rational angle completeness
• A near-minimal axiomatisation of ZX-calculus for pure qubit quantum mechanics
• Title not available (Why is that?)
• Two complete axiomatisations of pure-state qubit quantum computing
• Addition and differentiation of ZX-diagrams

This page was built for publication: Diagrammatic reasoning beyond Clifford+T quantum mechanics

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