Improved analytical bounds on delivery times of long-distance entanglement

Abstract

The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realizing the long-distance delivery of remote entanglement has been proposed, both for bipartite and multipartite entanglement. For assessing the viability of these schemes, knowledge of the time at which entanglement is delivered is crucial. Specifically, if the communication task requires multiple remote-entangled quantum states and these states are generated at different times by the scheme, the earlier states will need to wait and thus their quality will decrease while being stored in an (imperfect) memory. For the remote-entanglement delivery schemes which are closest to experimental reach, this time assessment is challenging, as they consist of nondeterministic components such as probabilistic entanglement swaps. For many such protocols even the average time at which entanglement can be distributed is not known exactly, in particular when they consist of feedback loops and forced restarts. In this work, we provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols in the case that all network components have success probabilities lower bounded by a constant. A canonical example of such a protocol is a nested quantum repeater scheme which consists of heralded entanglement generation and entanglement swaps. For this scheme specifically, our results imply that a common approximation to the mean entanglement distribution time, the 3-over-2 formula, is in essence an upper bound to the real time. Our results rely on a novel connection with reliability theory.

References in corpus (42)

• The Quantum Internet
• 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
• Quantum Repeaters with Photon Pair Sources and Multi-Mode Memories
• Efficient long distance quantum communication
• Fundamental rate-loss tradeoff for optical quantum key distribution
• Maximum efficiency of a linear-optical Bell-state analyzer
• Multiplexed Memory-Insensitive Quantum Repeaters
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Long-Distance Entanglement Distribution with Single-Photon Sources
• System Design for a Long-Line Quantum Repeater
• Robust and Efficient Quantum Repeaters with Atomic Ensembles and Linear Optics
• Quantum Repeaters based on Single Trapped Ions
• A fast and robust approach to long-distance quantum communication with atomic ensembles
• Entanglement over global distances via quantum repeaters with satellite links
• Modular architectures for quantum networks
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Rate analysis for a hybrid quantum repeater
• Robust quantum network architectures and topologies for entanglement distribution
• Tools for quantum network design
• Dephasing mechanisms of diamond-based nuclear-spin memories for quantum networks
• Practical figures of merit and thresholds for entanglement distribution in quantum networks
• Quantum repeaters and quantum key distribution: analysis of secret key rates
• Quantum repeaters in space
• Two dimensional quantum repeaters
• Quantum multiplexing
• Quantum repeaters with individual rare-earth ions at telecommunication wavelengths
• Efficient computation of the waiting time and fidelity in quantum repeater chains
• Near-term performance of quantum repeaters with imperfect ensemble-based quantum memories
• Multipartite state generation in quantum networks with optimal scaling
• Quantum repeater architecture with hierarchically optimized memory buffer times
• Distributed Routing in a Quantum Internet
• Statistical analysis of quantum entangled network generation
• Memory Imperfections in Atomic Ensemble-based Quantum Repeaters
• Persistent atomic frequency comb based on Zeeman sub-levels of an erbium-doped crystal waveguide
• Memory-assisted long-distance phase-matching quantum key distribution
• Scalable repeater architectures for multi-party states
• Reposition time in probabilistic imperfect memories
• Quantum telescopes
• Diagrammatic technique for simulation of large-scale quantum repeater networks with dissipating quantum memories
• Quantum repeaters based on individual electron spins and nuclear-spin-ensemble memories in quantum dots

Cited by in corpus (19)

• Optimal entanglement swapping in quantum repeaters
• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
• Requirements for a processing-node quantum repeater on a real-world fiber grid
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Aging and Reliability of Quantum Networks
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization
• Entanglement Swapping for Repeater Chains with Finite Memory Sizes
• Asymmetric node placement in fiber-based quantum networks
• Analytical Performance Estimations for Quantum Repeater Network Scenarios
• Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation
• Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning
• Quantum Internet: Resource Estimation for Entanglement Routing
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
• Quantum Computation, Data Science, and Bell games