Completeness of the ZX-calculus
From MaRDI portal
Publication:5114829
Authors: Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart
Publication date: 26 June 2020
Full work available at URL: https://arxiv.org/abs/1903.06035
Recommendations
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- Diagrammatic reasoning beyond Clifford+T quantum mechanics
- The ZX-calculus is complete for stabilizer quantum mechanics
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
- A generic normal form for ZX-diagrams and application to the rational angle completeness
Cites Work
- A complete graphical calculus for Spekkens' toy bit theory
- A survey of graphical languages for monoidal categories
- The ZX-calculus is complete for stabilizer quantum mechanics
- Interacting Quantum Observables
- Graph states and the necessity of Euler decomposition
- The Compositional Structure of Multipartite Quantum Entanglement
- Field Theory
- Interacting Frobenius algebras are Hopf
- The ZX-calculus is incomplete for quantum mechanics
- The ZX-calculus is complete for the single-qubit Clifford+T group
- Rewriting measurement-based quantum computations with generalised flow
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- Title not available (Why is that?)
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- A simplified stabilizer ZX-calculus
- Quantum picturalism for topological cluster-state computing
- ZX-rules for 2-qubit \(\text{2-qubit Clifford}+\text{T}\) quantum circuits
- Quantomatic: a proof assistant for diagrammatic reasoning
- Supplementarity is necessary for quantum diagram reasoning
- A diagrammatic axiomatisation for qubit entanglement
- Diagrammatic reasoning beyond Clifford+T quantum mechanics
- Verifying the Steane code with Quantomatic
- Title not available (Why is that?)
- Title not available (Why is that?)
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
- A graphical approach to measurement-based quantum computing
Cited In (11)
- Title not available (Why is that?)
- Multi-agent blind quantum computation without universal cluster states
- Hybrid quantum-classical circuit simplification with the ZX-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
- Graphical CSS Code Transformation Using ZX Calculus
- Title not available (Why is that?)
- Well-tempered ZX and ZH calculi
- 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
Uses Software
This page was built for publication: Completeness of the ZX-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114829)