The ZX-calculus is complete for stabilizer quantum mechanics
From MaRDI portal
(Redirected from Publication:3386971)
Abstract: The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics, meaning any pure state, unitary operation and post-selected pure projective measurement can be expressed in the ZX-calculus. The calculus is also sound, i.e. any equality that can be derived graphically can also be derived using matrix mechanics. Here, we show that the ZX-calculus is complete for pure qubit stabilizer quantum mechanics, meaning any equality that can be derived using matrices can also be derived pictorially. The proof relies on bringing diagrams into a normal form based on graph states and local Clifford operations.
Recommendations
- Qutrit ZX-calculus is complete for stabilizer quantum mechanics
- Making the stabilizer ZX-calculus complete for scalars
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- scientific article; zbMATH DE number 7327933
- The ZX-calculus is incomplete for quantum mechanics
- A simplified stabilizer ZX-calculus
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- The ZX-calculus is complete for the single-qubit Clifford+T group
- The ZX-calculus as a language for topological quantum computation
Cites work
- Dagger compact closed categories and completely positive maps (extended abstract)
- Graph states and the necessity of Euler decomposition
- Interacting Quantum Observables
- Interacting quantum observables: categorical algebra and diagrammatics
- Phase groups and the origin of non-locality for qubits
- Quantum computation and quantum information. 10th anniversary edition
- Quantum picturalism for topological cluster-state computing
- Rewriting measurement-based quantum computations with generalised flow
- Stabilizer notation for Spekkens' toy theory
- Strong complementarity and non-locality in categorical quantum mechanics
Cited in
(52)- scientific article; zbMATH DE number 7447789 (Why is no real title available?)
- scientific article; zbMATH DE number 7561699 (Why is no real title available?)
- A complete graphical calculus for Spekkens' toy bit theory
- Multi-agent blind quantum computation without universal cluster states
- Addition and differentiation of ZX-diagrams
- A topological perspective on interacting algebraic theories
- Hypergraph simplification: linking the path-sum approach to the ZH-calculus
- Equational reasoning with context-free families of string diagrams
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- scientific article; zbMATH DE number 7449988 (Why is no real title available?)
- The structure of sum-over-paths, its consequences, and completeness for Clifford
- scientific article; zbMATH DE number 7453176 (Why is no real title available?)
- scientific article; zbMATH DE number 7327933 (Why is no real title available?)
- scientific article; zbMATH DE number 7215290 (Why is no real title available?)
- Generalised Mermin-type non-locality arguments
- Classical control and quantum circuits in enriched category theory
- Optimising Clifford circuits with quantomatic
- The ZX-calculus is incomplete for quantum mechanics
- Completeness of the ZH-calculus
- A simplified stabilizer ZX-calculus
- Y-calculus: a language for real matrices derived from the ZX-calculus
- Qutrit ZX-calculus is complete for stabilizer quantum mechanics
- The category \textsf{CNOT}
- Shaded tangles for the design and verification of quantum programs (extended abstract)
- Mermin non-locality in abstract process theories
- A diagrammatic calculus of fermionic quantum circuits
- Operator dynamics and entanglement in space-time dual Hadamard lattices
- Shaded tangles for the design and verification of quantum circuits
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
- Making the stabilizer ZX-calculus complete for scalars
- Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
- Graphical CSS Code Transformation Using ZX Calculus
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- And-gates in ZX-calculus: spider nest identities and QBC-completeness
- Generators and relations for real stabilizer operators
- A diagrammatic axiomatisation of fermionic quantum circuits
- Biunitary constructions in quantum information
- A diagrammatic algebra for program logics
- The ZX-calculus is complete for the single-qubit Clifford+T group
- Categorical probabilistic theories
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- Approximate optimisation of quantum circuits using the ZX calculus with phase squashing
- Minimality in finite-dimensional ZW-calculi
- A graphical calculus for Lagrangian relations
- Towards Quantum Field Theory in Categorical Quantum Mechanics
- On the role of the basis of measurement in quantum gate teleportation
- Two complete axiomatisations of pure-state qubit quantum computing
- A graphical \#SAT algorithm for formulae with small clause density
- Scalable spider nests ({\dots}or how to graphically grok transversal non-Clifford gates)
- Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements
This page was built for publication: The ZX-calculus is complete for stabilizer quantum mechanics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386971)
