Constructive Simulation and Topological Design of Protocols
arXiv:1611.06447 · doi:10.1088/1367-2630/aa5b57
Abstract
We give a topological simulation for tensor networks that we call the two-string model. In this approach we give a new way to design protocols, and we discover a new multipartite quantum communication protocol. We introduce the notion of topologically-compressed transformations. Our new protocol can implement multiple, non-local compressed transformations among multi-parties using one multipartite resource state.
arXiv comment16 pages
References in corpus (21)
- Fault-tolerant quantum computation by anyons
- Experimental quantum teleportation
- Three qubits can be entangled in two inequivalent ways
- Quantum Teleportation is a Universal Computational Primitive
- String-net condensation: A physical mechanism for topological phases
- Multi-photon entanglement and interferometry
- Advances in Quantum Teleportation
- Quantum teleportation using active feed-forward between two Canary Islands
- Quantum teleportation and entanglement distribution over 100-kilometre free-space channels
- Tripartite Quantum State Sharing
- Optimal local implementation of non-local quantum gates
- Methodology for quantum logic gate constructions
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Quantum teleportation across a metropolitan fibre network
- Randomized Benchmarking with Confidence
- Experimental Three-Particle Quantum Nonlocality under Strict Locality Conditions
- Limitations to sharing entanglement
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Planar Para Algebras, Reflection Positivity
- Categorical Quantum Circuits
- Algebraically contractible topological tensor network states
Cited by in corpus (10)
- Biunitary constructions in quantum information
- Quons: A 3D Language for Quantum Information
- Classical simulation of quantum circuits by half Gauss sums
- Holographic Software for Quantum Networks
- A Mathematical Picture Language Program
- Charged String Tensor Networks
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
- Shaded tangles for the design and verification of quantum circuits
- De Finetti Theorems for Braided Parafermions