Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning

Abstract

Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. The nearest-future type of quantum repeater requires two operations: entanglement generation across neighbouring repeaters and entanglement swapping to promote short-range entanglement to long-range. For many hardware setups, these actions are probabilistic, leading to longer distribution times and incurred errors. Significant efforts have been vested in finding the optimal entanglement-distribution policy, i.e. the protocol specifying when a network node needs to generate or swap entanglement, such that the expected time to distribute long-distance entanglement is minimal. This problem is even more intricate in more realistic scenarios, especially when classical communication delays are taken into account. In this work, we formulate our problem as a Markov decision problem and use reinforcement learning (RL) to optimise over centralised strategies, where one designated node instructs other nodes which actions to perform. Contrary to most RL models, ours can be readily interpreted. Additionally, we introduce and evaluate a fixed local policy, the `predictive swap-asap' policy, where nodes only coordinate with nearest neighbours. Compared to the straightforward generalization of the common swap-asap policy to the scenario with classical communication effects, the `wait-for-broadcast swap-asap' policy, both of the aforementioned entanglement-delivery policies are faster at high success probabilities. Our work showcases the merit of considering policies acting with incomplete information in the realistic case when classical communication effects are significant.

16 pages, 8 figures

References in corpus (24)

• Quantum cryptography: Public key distribution and coin tossing
• Long-distance quantum communication with atomic ensembles and linear optics
• A quantum network of clocks
• Realization of a multi-node quantum network of remote solid-state qubits
• Quantum repeaters: From quantum networks to the quantum internet
• Deterministic delivery of remote entanglement on a quantum network
• Longer-Baseline Telescopes Using Quantum Repeaters
• Model-Free Quantum Control with Reinforcement Learning
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Tools for quantum network design
• Parameter regimes for a single sequential quantum repeater
• Optimal entanglement swapping in quantum repeaters
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
• Approximate Autonomous Quantum Error Correction with Reinforcement Learning
• Improved analytical bounds on delivery times of long-distance entanglement
• Optimizing Entanglement Generation and Distribution Using Genetic Algorithms
• 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
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Optimizing ZX-Diagrams with Deep Reinforcement Learning
• Log-Convex set of Lindblad semigroups acting on $N$-level system
• On the Analysis of Quantum Repeater Chains with Sequential Swaps
• Design and demonstration of an operating system for executing applications on quantum network nodes
• Tackling Decision Processes with Non-Cumulative Objectives using Reinforcement Learning