Entanglement Distribution in the Quantum Internet: Knowing when to Stop!

Abstract

Entanglement distribution is a key functionality of the Quantum Internet. However, quantum entanglement is very fragile, easily degraded by decoherence, which strictly constraints the time horizon within the distribution has to be completed. This, coupled with the quantum noise irremediably impinging on the channels utilized for entanglement distribution, may imply the need to attempt the distribution process multiple times before the targeted network nodes successfully share the desired entangled state. And there is no guarantee that this is accomplished within the time horizon dictated by the coherence times. As a consequence, in noisy scenarios requiring multiple distribution attempts, it may be convenient to stop the distribution process early. In this paper, we take steps in the direction of knowing when to stop the entanglement distribution by developing a theoretical framework, able to capture the quantum noise effects. Specifically, we first prove that the entanglement distribution process can be modeled as a Markov decision process. Then, we prove that the optimal decision policy exhibits attractive features, which we exploit to reduce the computational complexity. The developed framework provides quantum network designers with flexible tools to optimally engineer the design parameters of the entanglement distribution process.

References in corpus (34)

• The Quantum Internet
• Quantum sensing
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• On the Improvement of Frequency Stardards with Quantum Entanglement
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• Capacities of Quantum Erasure Channels
• When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
• Distributed Quantum Computing: a Survey
• Quantum-Enhanced Sensing Based on Time Reversal of Nonlinear Dynamics
• Multi-partite entanglement speeds up quantum key distribution in networks
• Heralded generation of entangled photon pairs
• A quantum network stack and protocols for reliable entanglement-based networks
• Quantum Switch for the Quantum Internet: Noiseless Communications through Noisy Channels
• Modular architectures for quantum networks
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Practical figures of merit and thresholds for entanglement distribution in quantum networks
• Distributing Multipartite Entanglement over Noisy Quantum Networks
• Optimal entanglement swapping in quantum repeaters
• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• On the Stochastic Analysis of a Quantum Entanglement Switch
• Quantum entanglement and classical communication through a depolarising channel
• Recursive quantum repeater networks
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
• Genuine quantum networks: superposed tasks and addressing
• Policies for elementary links in a quantum network
• Beyond Shannon Limits: Quantum Communications through Quantum Paths
• The Quantum Internet: Enhancing Classical Internet Services one Qubit at a Time
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Quantum communication cost of preparing multipartite entanglement
• Quantum Internet Addressing
• Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Aging and Reliability of Quantum Networks

Cited by in corpus (8)

• Intra-QLAN Connectivity: beyond the Physical Topology
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes
• Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks
• A Quantum Algorithm for the Classification of Patterns of Boolean Functions
• A novel $2$ \& $3$ player scheme for Quantum Direct Communication
• Quantum Shadows: The Dining Information Brokers
• Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance