Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach

Abstract

We consider the problem of optimising the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum internet, where the repeaters may perform a probabilistic bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming formulation that computes the maximum total achievable entanglement distribution rate, satisfying the end-to-end fidelity constraint in polynomial time (in the number of nodes in the network). We also propose an efficient algorithm that takes the output of the linear programming solver as an input and runs in polynomial time (in the number of nodes) to produce the set of paths to be used to achieve the entanglement distribution rate. Moreover, we point out a practical entanglement generation protocol which can achieve those rates.

References in corpus (4)

• The Quantum Internet
• Quantum cryptography: Public key distribution and coin tossing
• Multistage Entanglement Swapping
• Versatile relative entropy bounds for quantum networks

Cited by in corpus (7)

• Experimental demonstration of entanglement delivery using a quantum network stack
• Optimized compiler for Distributed Quantum Computing
• Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees
• Policies for elementary links in a quantum network
• Pre-Distribution of Entanglements in Quantum Networks
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Resource Allocation in Quantum Networks for Distributed Quantum Computing