Holographic Software for Quantum Networks
arXiv:1605.00127 · doi:10.1007/s11425-017-9207-3
Abstract
We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform (SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the -qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.
arXiv comment48 pages. Accepted for publication in SCIENCE CHINA Mathematics
References in corpus (41)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- The Quantum Internet
- Elementary gates for quantum computation
- Efficient classical simulation of slightly entangled quantum computations
- Quantum Teleportation is a Universal Computational Primitive
- String-net condensation: A physical mechanism for topological phases
- Ground-to-satellite quantum teleportation
- A Theory of Fault-Tolerant Quantum Computation
- A Multiparticle Generalization of Entanglement Swapping
- Quantum teleportation using active feed-forward between two Canary Islands
- Multipartite entanglement for continuous variables: A quantum teleportation network
- Quantum teleportation and entanglement distribution over 100-kilometre free-space channels
- Optimal local implementation of non-local quantum gates
- Quantum Correlations in Two-Fermion Systems
- Programmable quantum gate arrays
- Methodology for quantum logic gate constructions
- A practical scheme for quantum computation with any two-qubit entangling gate
- Quantum remote control: Teleportation of unitary operations
- Simulation of topological field theories by quantum computers
- Long-Distance Quantum Communication with Entangled Photons using Satellites
- Double-Occupancy Errors, Adiabaticity, and Entanglement of Spin-Qubits in Quantum Dots
- Topological Computation without Braiding
- Entanglement dynamics in the Lipkin-Meshkov-Glick model
- Comparing Quantum Entanglement and Topological Entanglement
- A hierarchy of topological tensor network states
- Quantum Computing with Parafermions
- Remote operations and interactions for systems of arbitrary dimensional Hilbert space: a state-operator approach
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Noncommutative Uncertainty Principles
- Error free quantum communication through noisy channels
- Categorical Tensor Network States
- An Ideal Characterization of the Clifford Operators
- Planar Para Algebras, Reflection Positivity
- Hybrid protocol of remote implementations of quantum operations
- Continuum tensor network field states, path integral representations and the encoding of spatial symmetries
- Quons: A 3D Language for Quantum Information
- Reflection Positivity for Parafermions
- Characterization of Reflection Positivity: Majoranas and Spins
- Constructive Simulation and Topological Design of Protocols
- A Mathematical Picture Language Program
Cited by in corpus (8)
- Quantum scrambling with classical shadows
- Quantum Fourier Analysis
- Classical simulation of quantum circuits by half Gauss sums
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- Quantum teleportation in the commuting operator framework
- De Finetti Theorems for Braided Parafermions
- Zigzag normalisation for associative -categories
- The planar parafermion algebra: The clock model and the coupled Temperley-Lieb algebra