Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

Abstract

Quantum network communication is challenging, as the No-cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable communication approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. The focus of our work is to develop efficient techniques that minimize EP generation latency. Prior works have focused on selecting entanglement paths; in contrast, we select entanglement swapping trees--a more accurate representation of the entanglement generation structure. We develop a dynamic programming algorithm to select an optimal swapping-tree for a single pair of nodes, under the given capacity and fidelity constraints. For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees. We present simulation results which show that our solutions outperform the prior approaches by an order of magnitude and are viable for long-distance entanglement generation.

References in corpus (15)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Entanglement detection
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• Room temperature quantum bit storage exceeding 39 minutes using ionized donors in 28-silicon
• Towards a global quantum network
• Single ion-qubit exceeding one hour coherence time
• Multiplexed Memory-Insensitive Quantum Repeaters
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Designing a Quantum Network Protocol
• Field test of a practical secure communication network with decoy-state quantum cryptography
• Process tomography of dynamical decoupling in a dense optically trapped atomic ensemble
• Optimal approach to quantum communication using dynamic programming
• Distributing Multipartite Entanglement over Noisy Quantum Networks
• Improved analytical bounds on delivery times of long-distance entanglement
• Photon-Echo Quantum Memory

Cited by in corpus (5)

• Pre-Distribution of Entanglements in Quantum Networks
• Quantum Sensor Network Algorithms for Transmitter Localization
• No-go theorems for photon state transformations in quantum linear optics
• Parallel Segment Entanglement Swapping
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems