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 (34)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Mixed State Entanglement and Quantum Error Correction
• The Security of Practical Quantum Key Distribution
• Long-distance quantum communication with atomic ensembles and linear optics
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Entanglement detection
• Optical interface created by laser-cooled atoms trapped in the evanescent field surrounding an optical nanofiber
• A quantum network of clocks
• Quantum Error Correction for Beginners
• Experimental demonstration of memory-enhanced quantum communication
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• All photonic quantum repeaters
• Efficient long distance quantum communication
• Towards optimal single-photon sources from polarized microcavities
• Room temperature quantum bit storage exceeding 39 minutes using ionized donors in 28-silicon
• Towards a global quantum network
• Long-lived qubit memory using atomic ions
• Quantum Error Correction: An Introductory Guide
• Single ion-qubit exceeding one hour coherence time
• Multiplexed Memory-Insensitive Quantum Repeaters
• A Link Layer Protocol for Quantum Networks
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Dynamic decoherence control of a solid-state nuclear quadrupole qubit
• Spin self-rephasing and very long coherence times in a trapped atomic ensemble
• Optimal and Secure Measurement Protocols for Quantum Sensor Networks
• Quantum Internet: from Communication to Distributed Computing!
• Designing a Quantum Network Protocol
• Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach
• 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 (7)

• 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
• Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
• Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks