The ZX-calculus is complete for stabilizer quantum mechanics
arXiv:1307.7025 · doi:10.1088/1367-2630/16/9/093021
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.
26 pages
References in corpus (3)
Cited by in corpus (63)
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Reducing T-count with the ZX-calculus
- Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
- The ZX calculus is a language for surface code lattice surgery
- There and back again: A circuit extraction tale
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Optimized compiler for Distributed Quantum Computing
- Pivoting makes the ZX-calculus complete for real stabilizers
- Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
- The ZX-calculus is complete for the single-qubit Clifford+T group
- Unifying flavors of fault tolerance with the ZX calculus
- Biunitary constructions in quantum information
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Making the stabilizer ZX-calculus complete for scalars
- Categorical Probabilistic Theories
- Optimising Clifford Circuits with Quantomatic
- Graphical Structures for Design and Verification of Quantum Error Correction
- Verifying the Smallest Interesting Colour Code with Quantomatic
- Visualizing Entanglement in multi-Qubit Systems
- Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
- A Simplified Stabilizer ZX-calculus
- A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
- Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
- Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
- Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics
- Operator dynamics and entanglement in space-time dual Hadamard lattices
- Towards Quantum Field Theory in Categorical Quantum Mechanics
- Depicting qudit quantum mechanics and mutually unbiased qudit theories
- A complete graphical calculus for Spekkens' toy bit theory
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- A Graphical Calculus for Lagrangian Relations
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
- Normalization for planar string diagrams and a quadratic equivalence algorithm
- The Category CNOT
- Graphical CSS Code Transformation Using ZX Calculus
- Completeness of the ZH-calculus
- Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
- Y-Calculus: A Language for Real Matrices Derived from the ZX-Calculus
- Generators and Relations for Real Stabilizer Operators
- Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
- Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
- Optimal compilation of parametrised quantum circuits
- Mermin Non-Locality in Abstract Process Theories
- Addition and Differentiation of ZX-diagrams
- A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization
- Multi-agent blind quantum computation without universal cluster states
- Shaded tangles for the design and verification of quantum circuits
- Equivalence checking of quantum circuits via intermediary matrix product operator
- Universal graph representation of stabilizer codes
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
- Visualizing Quantum States: A Pilot Study on Problem Solving in Quantum Information Science Education
- Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
- Proceedings 13th International Conference on Quantum Physics and Logic
- Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
- Transversal AND in Quantum Codes
- A Topological Perspective on Interacting Algebraic Theories
- Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
- A Graphical #SAT Algorithm for Formulae with Small Clause Density
- A Functorial Construction of Quantum Subtheories