The algebra of entanglement and the geometry of composition
arXiv:1709.08086
Abstract
String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of higher algebraic theories, and as combinatorial descriptions of "directed spaces". Operations of polygraphs modelled on operations of topological spaces are used as the foundation of a compositional universal algebra, where sliding moves arise from tensor products of polygraphs. We reconstruct several higher algebraic theories in this framework. In this regard, the standard formalism of polygraphs has some technical problems. We propose a notion of regular polygraph, barring cell boundaries that are not homeomorphic to a disk of the appropriate dimension. We define a category of non-degenerate shapes, and show how to calculate their tensor products. Then, we introduce a notion of weak unit to recover weakly degenerate boundaries in low dimensions, and prove that the existence of weak units is equivalent to a representability property. We then turn to applications of diagrammatic algebra to quantum theory. We re-evaluate the category of Hilbert spaces from the perspective of categorical universal algebra, which leads to a bicategorical refinement. Then, we focus on the axiomatics of fragments of quantum theory, and present the ZW calculus, the first complete diagrammatic axiomatisation of the theory of qubits. The ZW calculus has several advantages over ZX calculi, including a computationally meaningful normal form, and a fragment whose diagrams can be read as setups of fermionic oscillators. Moreover, its generators reflect an operational classification of entangled states of 3 qubits. We conclude with generalisations of the ZW calculus to higher-dimensional systems, including the definition of a universal set of generators in each dimension.
arXiv commentv2: changes to end of Chapter 3. v1: 214 pages, many figures; University of Oxford doctoral thesis
References in corpus (31)
- Three qubits can be entangled in two inequivalent ways
- Persistent entanglement in arrays of interacting particles
- Fermionic quantum computation
- Noncommuting mixed states cannot be broadcast
- Impossibility of deleting an unknown quantum state
- Inductive Entanglement Classification of Four Qubits under SLOCC
- Iterated wreath product of the simplex category and iterated loop spaces
- Inductive classification of multipartite entanglement under SLOCC
- Abstract Physical Traces
- Monads with arities and their associated theories
- Interacting Hopf Algebras
- The Feynman problem and Fermionic entanglement: Fermionic theory versus qubit theory
- The ZX-calculus is incomplete for quantum mechanics
- A universal completion of the ZX-calculus
- Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing
- The ZX-calculus is complete for the single-qubit Clifford+T group
- Connector algebras for C/E and P/T nets' interactions
- Almost quantum theory
- Biunitary constructions in quantum information
- The Topology of Quantum Algorithms
- Pictures of complete positivity in arbitrary dimension
- Towards 3-Dimensional Rewriting Theory
- Finite dimensional Hilbert spaces are complete for dagger compact closed categories
- The GHZ/W-calculus contains rational arithmetic
- The compositional structure of multipartite quantum entanglement
- Globular: an online proof assistant for higher-dimensional rewriting
- A direct proof that the category of 3-computads is not cartesian closed
- Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
- Aspects of Cubical Higher Category Theory
- The Abstract Structure of Quantum Algorithms
- Surface Proofs for Nonsymmetric Linear Logic (Extended Abstract)
Cited by in corpus (22)
- ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
- ZX-calculus for the working quantum computer scientist
- A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
- Completeness of the ZX-Calculus
- How to Sum and Exponentiate Hamiltonians in ZXW Calculus
- ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
- Quantum Linear Optics via String Diagrams
- The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
- Regular polygraphs and the Simpson conjecture
- Completeness of algebraic ZX-calculus over arbitrary commutative rings and semirings
- AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
- Light-Matter Interaction in the ZXW Calculus
- Completeness of the ZH-calculus
- A non-anyonic qudit ZW-calculus
- On a recipe for quantum graphical languages
- Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
- Entanglement and Quaternions: The graphical calculus ZQ
- Diagrammatic sets and rewriting in weak higher categories
- A diagrammatic calculus of fermionic quantum circuits
- Representable diagrammatic sets as a model of weak higher categories
- The folk model category structure on strict -categories is monoidal
- Graphical Calculi and their Conjecture Synthesis