Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
From MaRDI portal
Publication:2055955
DOI10.1016/j.tcs.2021.07.024zbMath1484.81023arXiv2102.10984OpenAlexW3192612743WikidataQ114013032 ScholiaQ114013032MaRDI QIDQ2055955
Dominic Horsman, Aleks Kissinger, Quanlong Wang, Bob Coecke
Publication date: 1 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10984
Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06) Mathematical programming (educational aspects) (97N60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete graphical calculus for Spekkens' toy bit theory
- Interacting Hopf algebras
- Monoidal computer. I: Basic computability by string diagrams
- Cartesian bicategories. I
- Towards an algebraic theory of Boolean circuits.
- Terminality implies no-signalling\dots and much more than that
- ZX-rules for 2-qubit \(\text{2-qubit Clifford}+\text{T}\) quantum circuits
- Contextual equivalence for signal flow graphs
- Quantum theory: informational foundations and foils
- Full Abstraction for Signal Flow Graphs
- Toy Quantum Categories (Extended Abstract)
- Phase Groups and the Origin of Non-locality for Qubits
- Picturing Quantum Processes
- Strong Complementarity and Non-locality in Categorical Quantum Mechanics
- A universe of processes and some of its guises
- Categorical Probabilistic Theories
- The ZX-calculus is complete for stabilizer quantum mechanics
- Tutorial: Graphical Calculus for Quantum Circuits
- Quantomatic: A Proof Assistant for Diagrammatic Reasoning
- Interacting Quantum Observables
- Graph States and the Necessity of Euler Decomposition
- Representations of Petri Net Interactions
- Rewriting Measurement-Based Quantum Computations with Generalised Flow
- The Compositional Structure of Multipartite Quantum Entanglement
- A no-go theorem for theories that decohere to quantum mechanics
- A Diagrammatic Axiomatisation for Qubit Entanglement
- Interacting Frobenius Algebras are Hopf
- Open-graphs and monoidal theories
- A new description of orthogonal bases
- Trichromatic Open Digraphs for Understanding Qubits
- A Study of Entanglement in a Categorical Framework of Natural Language
- The ZX-calculus is incomplete for quantum mechanics
- Interacting quantum observables: categorical algebra and diagrammatics
- Surface code quantum computing by lattice surgery
- Two complete axiomatisations of pure-state qubit quantum computing
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
- Generalised Mermin-type non-locality arguments
- The Frobenius anatomy of word meanings I: subject and object relative pronouns
- Interacting Bialgebras Are Frobenius
