A simplified stabilizer ZX-calculus
From MaRDI portal
Publication:5014779
Recommendations
- scientific article; zbMATH DE number 7327933
- The 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
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
Cites work
- Graph states and the necessity of Euler decomposition
- Interacting quantum observables: categorical algebra and diagrammatics
- Making the stabilizer ZX-calculus complete for scalars
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- Quantum computation and quantum information. 10th anniversary edition
- Supplementarity is necessary for quantum diagram reasoning
- The Heisenberg representation of quantum computers
- The ZX-calculus is complete for stabilizer quantum mechanics
- The ZX-calculus is incomplete for quantum mechanics
Cited in
(19)- Categorical quantum cryptography for access control in cloud computing
- Game theoretic security of quantum bit commitment
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- scientific article; zbMATH DE number 7447789 (Why is no real title available?)
- Optimising Clifford circuits with quantomatic
- scientific article; zbMATH DE number 7449988 (Why is no real title available?)
- The ZX-calculus is complete for stabilizer quantum mechanics
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- Making the stabilizer ZX-calculus complete for scalars
- SZX-calculus: scalable graphical quantum reasoning
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
- Completeness of the ZX-calculus
- scientific article; zbMATH DE number 7327933 (Why is no real title available?)
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Well-tempered ZX and ZH calculi
- An algebraic axiomatisation of ZX-calculus
- Procedurally optimised ZX-diagram cutting for efficient T-decomposition in classical simulation
- Minimal equational theories for quantum circuits
- A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
This page was built for publication: A simplified stabilizer ZX-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014779)