General Scheme for Perfect Quantum Network Coding with Free Classical Communication
arXiv:0908.1457 · doi:10.1007/978-3-642-02927-1_52
Abstract
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with source-target pairs if there exists a classical linear (or even vector linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of , the maximal fan-in of any network node, and the size of the network.
12 pages, 2 figures, generalizes some of the results in arXiv:0902.1299 to the k-pair problem and codes over rings. Appeared in the Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), LNCS 5555, pp. 622-633, 2009
References in corpus (3)
Cited by in corpus (21)
- Quantum network routing and local complementation
- Surface code compilation via edge-disjoint paths
- Opportunistic Entanglement Distribution for the Quantum Internet
- Experimental Quantum Network Coding
- Entanglement Access Control for the Quantum Internet
- Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices
- Analysis of Measurement-based Quantum Network Coding over Repeater Networks under Noisy Conditions
- Entanglement Accessibility Measures for the Quantum Internet
- Adaptive Routing for Quantum Memory Failures in the Quantum Internet
- Topology Adaption for the Quantum Internet
- Secure Quantum Network Coding on Butterfly Network
- Network coding for distributed quantum computation over cluster and butterfly networks
- Quantum computation over the butterfly network
- Secure Quantum Network Code without Classical Communication
- Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
- Quantum linear network coding for entanglement distribution in restricted architectures
- Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks
- A Poisson Model for Entanglement Optimization in the Quantum Internet
- Exploring the limitations of quantum networking through butterfly-based networks
- Two-Server Oblivious Transfer for Quantum Messages
- Multicast quantum network coding as optimal symmetric universal cloning over a quantum network