The ZX-calculus is complete for stabilizer quantum mechanics

DOI10.1088/1367-2630/16/9/093021zbMATH Open1451.81014arXiv1307.7025OpenAlexW3103730115WikidataQ64356747 ScholiaQ64356747MaRDI QIDQ3386971FDOQ3386971

Authors: Miriam Backens 

Publication date: 12 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

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.

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

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

Mathematics Subject Classification ID

General and philosophical questions in quantum theory (81P05) Quantum measurement theory, state operations, state preparations (81P15) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum gates (81P65)

Cites Work

• Phase groups and the origin of non-locality for qubits
• Dagger compact closed categories and completely positive maps (extended abstract)
• Quantum computation and quantum information. 10th anniversary edition
• Interacting Quantum Observables
• Graph states and the necessity of Euler decomposition
• Stabilizer notation for Spekkens' toy theory
• Interacting quantum observables: categorical algebra and diagrammatics
• Rewriting measurement-based quantum computations with generalised flow
• Strong complementarity and non-locality in categorical quantum mechanics
• Quantum picturalism for topological cluster-state computing

Cited In (46)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The structure of sum-over-paths, its consequences, and completeness for Clifford
• Generalised Mermin-type non-locality arguments
• Title not available (Why is that?)
• Classical control and quantum circuits in enriched category theory
• The ZX-calculus is incomplete for quantum mechanics
• Optimising Clifford circuits with quantomatic
• Completeness of the ZH-calculus
• A simplified stabilizer ZX-calculus
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Making the stabilizer ZX-calculus complete for scalars
• 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
• Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
• 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
• The ZX-calculus is complete for the single-qubit Clifford+T group
• Categorical probabilistic theories
• Title not available (Why is that?)
• Towards Quantum Field Theory in Categorical Quantum Mechanics
• Two complete axiomatisations of pure-state qubit quantum computing
• On the role of the basis of measurement in quantum gate teleportation

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)