Optimal entanglement swapping in quantum repeaters

Abstract

We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that the commonly used "doubling" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher "nesting levels", our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different number of segments, confirming again the optimality of "non-doubling" in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.

10 pages, 5 figures

References in corpus (5)

• Multiplexed Memory-Insensitive Quantum Repeaters
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• Tools for quantum network design
• Improved analytical bounds on delivery times of long-distance entanglement

Cited by in corpus (21)

• Simulating quantum repeater strategies for multiple satellites
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Deep reinforcement learning for key distribution based on quantum repeaters
• Entanglement Distribution in the Quantum Internet: Knowing when to Stop!
• ReQuSim: Faithfully simulating near-term quantum repeaters
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Entanglement Swapping for Repeater Chains with Finite Memory Sizes
• Analytical Performance Estimations for Quantum Repeater Network Scenarios
• Continuously Distributing Entanglement in Quantum Networks with Regular Topologies
• Statistical analysis of Multipath Entanglement Purification in Quantum Networks
• Constant Overhead Entanglement Distillation via Scrambling
• Protocol for suppression of noise from stimulated multi-photon emissions in concatenated entanglement swapping links and quantum repeaters
• Memory-corrected quantum repeaters with adaptive syndrome identification
• General Concurrence Percolation on Quantum Networks
• Generation of bipartite mechanical cat state by performing projective Bell state measurement
• Swapping of quantum correlations and the role of local filtering operations
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
• Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning
• Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning