EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Jan Li, Tim Coopmans, Patrick Emonts, Kenneth Goodenough, Jordi Tura, Evert van Nieuwenburg

Machine Learning: Science and Technology · 30.09.2025 · 6 (3) · 035024

DOI: 10.1088/2632-2153/adeefa ↗

Kurz gefasst

Fachartikel in der Zeitschrift Machine Learning: Science and Technology, online erschienen am 06.08.2025. Verfasst von Jan Li und 5 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NWO-Quantum Technology program, ERC StG FINE-TEA-SQUAD, Dutch National Growth Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 generalisation 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.

Förderung

  • NWO-Quantum Technology program
  • ERC StG FINE-TEA-SQUAD
  • Dutch National Growth Fund
  • Quantum Inspire - the Dutch Quantum Computer in the Cloud
  • NWO Quantum Technology program

Zitieren

APA

Li, J., Coopmans, T., Emonts, P., Goodenough, K., Tura, J., & Nieuwenburg, E. V. (2025). Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning. Machine Learning: Science and Technology, 6(3), 035024. https://doi.org/10.1088/2632-2153/adeefa

Vancouver

Li J, Coopmans T, Emonts P, Goodenough K, Tura J, Nieuwenburg EV. Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning. Machine Learning: Science and Technology. 2025;6(3):035024. doi:10.1088/2632-2153/adeefa

BibTeX
@article{Li2025,
  author = {Li, Jan and Coopmans, Tim and Emonts, Patrick and Goodenough, Kenneth and Tura, Jordi and Nieuwenburg, Evert van},
  title = {Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning},
  journal = {Machine Learning: Science and Technology},
  year = {2025},
  volume = {6},
  number = {3},
  pages = {035024},
  doi = {10.1088/2632-2153/adeefa}
}
Kostenlos starten →