Shaded tangles for the design and verification of quantum circuits
arXiv:1805.01540 · doi:10.1098/rspa.2018.0338
Abstract
We give a scheme for interpreting shaded tangles as quantum circuits, with the property that if two shaded tangles are ambient isotopic, their corresponding computational effects are identical. We analyze 11 known quantum procedures in this way -- including entanglement manipulation, error correction and teleportation -- and in each case present a fully-topological formal verification, yielding generalized procedures in some cases. We also use our methods to identify 2 new procedures, for topological state transfer and quantum error correction. Our formalism yields in some cases significant new insight into how the procedures work, including a description of quantum entanglement arising from topological entanglement of strands, and a description of quantum error correction where errors are `trapped by bubbles' and removed from the shaded tangle.
arXiv comment35 pages. A short version of this paper can be found at arXiv:1701.03309. Final version
References in corpus (38)
- Quantum secret sharing
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Persistent entanglement in arrays of interacting particles
- On mutually unbiased bases
- Quantum error-correcting codes associated with graphs
- Graphical description of the action of local Clifford transformations on graph states
- Modular Entanglement of Atomic Qubits using both Photons and Phonons
- A survey of graphical languages for monoidal categories
- All Teleportation and Dense Coding Schemes
- A Short Introduction to Topological Quantum Computation
- The Classification of Two-Dimensional Extended Topological Field Theories
- Planar algebras, I
- Comparing Quantum Entanglement and Topological Entanglement
- The ZX-calculus is complete for stabilizer quantum mechanics
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- A new description of orthogonal bases
- Pivoting makes the ZX-calculus complete for real stabilizers
- Minimally complex ion traps as modules for quantum communication and computing
- The ZX-calculus is incomplete for quantum mechanics
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Quasistrict symmetric monoidal 2-categories via wire diagrams
- Entangled Entanglement: The Geometry of GHZ States
- Verifying the Steane code with Quantomatic
- Biunitary constructions in quantum information
- Quantum algorithms for spin models and simulable gate sets for quantum computation
- The Topology of Quantum Algorithms
- Planar Para Algebras, Reflection Positivity
- Quons: A 3D Language for Quantum Information
- Gray categories with duals and their diagrams
- Higher Quantum Theory
- Environment and classical channels in categorical quantum mechanics
- Generalized Graph States Based on Hadamard Matrices
- Constructive Simulation and Topological Design of Protocols
- GLC actors, artificial chemical connectomes, topological issues and knots
- Coherence for Frobenius pseudomonoids and the geometry of linear proofs
- Tangle Machines
- Compressed Teleportation
- Low-Dimensional Topology of Information Fusion