Perfect Quantum Network Communication Protocol Based on Classical Network Coding

Abstract

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.

LaTeX2e, 10 pages, 2 figures

References in corpus (3)

• Quantum network communication -- the butterfly and beyond
• Quantum Network Coding
• Prior entanglement between senders enables perfect quantum network coding with modification

Cited by in corpus (27)

• A Survey on Quantum Channel Capacities
• Multi-partite entanglement speeds up quantum key distribution in networks
• Decentralized Base-Graph Routing for the Quantum Internet
• Tools for quantum network design
• Opportunistic Entanglement Distribution for the Quantum Internet
• Experimental Quantum Network Coding
• Quantum Router with Network Coding
• Entanglement Access Control for the Quantum Internet
• Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices
• 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
• Secure Quantum Network Code without Classical Communication
• Computation-aided classical-quantum multiple access to boost network communication speeds
• Nonlocal quantum information in bipartite quantum error correction
• Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
• Unveiling the Importance of Nonshortest Paths in Quantum Networks
• Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks
• A Poisson Model for Entanglement Optimization in the Quantum Internet
• Quantum Capacity of Partially Corrupted Quantum Network
• Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
• Quantum Capacities for Entanglement Networks
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication
• Effect of Quantum correlation on Perfect K pair Quantum Network Coding
• Multicast quantum network coding as optimal symmetric universal cloning over a quantum network