Efficient computation of the waiting time and fidelity in quantum repeater chains

Abstract

Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The distance that quantum communication schemes can cover via direct communication is fundamentally limited by losses on the communication channel. By means of quantum repeaters, the reach of these schemes can be extended and chains of quantum repeaters could in principle cover arbitrarily long distances. In this work, we provide two efficient algorithms for determining the generation time and fidelity of the first generated entangled pair between the end nodes of a quantum repeater chain. The runtime of the algorithms increases polynomially with the number of segments of the chain, which improves upon the exponential runtime of existing algorithms. Our first algorithm is probabilistic and can analyze refined versions of repeater chain protocols which include intermediate entanglement distillation. Our second algorithm computes the waiting time distribution up to a pre-specified truncation time, has faster runtime than the first one and is moreover exact up to machine precision. Using our proof-of-principle implementation, we are able to analyze repeater chains of thousands of segments for some parameter regimes. The algorithms thus serve as useful tools for the analysis of large quantum repeater chain protocols and topologies of the future quantum internet.

References in corpus (37)

• The Quantum Internet
• Mixed State Entanglement and Quantum Error Correction
• Long-distance quantum communication with atomic ensembles and linear optics
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• Distributed Quantum Computation over Noisy Channels
• Optical quantum computation using cluster states
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• All photonic quantum repeaters
• Efficient long distance quantum communication
• Quantum Clock Synchronization Based on Shared Prior Entanglement
• Entanglement purification and quantum error correction
• Quantum Repeater with Encoding
• Multiplexed Memory-Insensitive Quantum Repeaters
• Ultrafast and Fault-Tolerant Quantum Communication across Long Distances
• Distributed Quantum Sensing Using Continuous-Variable Multipartite Entanglement
• Distributed Quantum Metrology and the Entangling Power of Linear Networks
• From quantum fusiliers to high-performance networks
• Surface code quantum communication
• System Design for a Long-Line Quantum Repeater
• Rate-distance tradeoff and resource costs for all-optical quantum repeaters
• A fast and robust approach to long-distance quantum communication with atomic ensembles
• Rate-loss analysis of an efficient quantum repeater architecture
• Optimizing practical entanglement distillation
• Deterministic generation of all-photonic quantum repeaters from solid-state emitters
• Rate analysis for a hybrid quantum repeater
• Measurement based entanglement under conditions of extreme photon loss
• Parameter regimes for a single sequential quantum repeater
• Overcoming erasure errors with multilevel systems
• Quantum repeaters and quantum key distribution: analysis of secret key rates
• Non-asymptotic entanglement distillation
• Scalable photonic network architecture based on motional averaging in room temperature gas
• Long-distance entanglement distribution using individual atoms in optical cavities
• Quantum repeater architecture with hierarchically optimized memory buffer times
• Statistical analysis of quantum entangled network generation
• Memory Imperfections in Atomic Ensemble-based Quantum Repeaters
• Quantum telescopes

Cited by in corpus (14)

• Tools for quantum network design
• Distributing Multipartite Entanglement over Noisy Quantum Networks
• Optimising repeater schemes for the quantum internet
• Quantum NETwork: from theory to practice
• Complex Quantum Networks: a Topical Review
• Improved analytical bounds on delivery times of long-distance entanglement
• Policies for elementary links in a quantum network
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time
• Deep reinforcement learning for key distribution based on quantum repeaters
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Aging and Reliability of Quantum Networks
• Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization
• Simulation of fidelity in entanglement-based networks with repeater chains
• Quantum Internet: Resource Estimation for Entanglement Routing