Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
arXiv:1701.03309 · doi:10.4204/EPTCS.266.21
Abstract
We give a scheme for interpreting shaded tangles as quantum programs, with the property that isotopic tangles yield equivalent programs. We analyze many known quantum programs in this way -- including entanglement manipulation and error correction -- and in each case present a fully-topological formal verification, yielding in several cases substantial new insight into how the program works. We also use our methods to identify several new or generalized procedures.
arXiv commentIn Proceedings QPL 2017, arXiv:1802.09737
References in corpus (35)
- Quantum secret sharing
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- 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
- 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
- Kindergarten 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
- 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
- Quantomatic: A Proof Assistant for Diagrammatic Reasoning
- Planar Para Algebras, Reflection Positivity
- Gray categories with duals and their diagrams
- Environment and classical channels in categorical quantum mechanics
- Higher Quantum Theory
- Generalized Graph States Based on Hadamard Matrices
- Constructive Simulation and Topological Design of Protocols
- Coherence for Frobenius pseudomonoids and the geometry of linear proofs
- Compressed Teleportation