{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:12:58Z","timestamp":1774120378505,"version":"3.50.1"},"reference-count":51,"publisher":"IOP Publishing","issue":"3","license":[{"start":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T00:00:00Z","timestamp":1754438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T00:00:00Z","timestamp":1754438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"name":"NWO-Quantum Technology program","award":["NGF.1623.23.006"],"award-info":[{"award-number":["NGF.1623.23.006"]}]},{"name":"ERC StG FINE-TEA-SQUAD","award":["101040729"],"award-info":[{"award-number":["101040729"]}]},{"name":"Dutch National Growth Fund"},{"name":"Quantum Inspire - the Dutch Quantum Computer in the Cloud","award":["NWA.1292.19.19"],"award-info":[{"award-number":["NWA.1292.19.19"]}]},{"name":"NWO Quantum Technology program","award":["NGF.1582.22.035"],"award-info":[{"award-number":["NGF.1582.22.035"]}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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 \u2018predictive swap-asap\u2019 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 \u2018wait-for-broadcast swap-asap\u2019 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.<\/jats:p>","DOI":"10.1088\/2632-2153\/adeefa","type":"journal-article","created":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T22:58:00Z","timestamp":1752274680000},"page":"035024","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning"],"prefix":"10.1088","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8835-4210","authenticated-orcid":true,"given":"Jan","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9780-0949","authenticated-orcid":true,"given":"Tim","family":"Coopmans","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7274-4071","authenticated-orcid":true,"given":"Patrick","family":"Emonts","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1761-0038","authenticated-orcid":true,"given":"Kenneth","family":"Goodenough","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6123-1422","authenticated-orcid":true,"given":"Jordi","family":"Tura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0323-0031","authenticated-orcid":true,"given":"Evert","family":"van Nieuwenburg","sequence":"additional","affiliation":[]}],"member":"266","published-online":{"date-parts":[[2025,8,6]]},"reference":[{"key":"mlstadeefabib1","doi-asserted-by":"publisher","first-page":"6412","DOI":"10.1126\/science.aam9288","article-title":"Quantum internet: a vision for the road ahead","volume":"362","author":"Wehner","year":"2018","journal-title":"Science"},{"key":"mlstadeefabib2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","article-title":"Quantum cryptography: public key distribution and coin tossing","volume":"560","author":"Bennett","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"mlstadeefabib3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","article-title":"Quantum cryptography based on Bell\u2019s theorem","volume":"67","author":"Ekert","year":"1991","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib4","first-page":"517","article-title":"Universal blind quantum computation","author":"Broadbent","year":"2009"},{"key":"mlstadeefabib5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.070503","article-title":"Longer-baseline telescopes using quantum repeaters","volume":"109","author":"Gottesman","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib6","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1038\/nphys3000","article-title":"A quantum network of clocks","volume":"10","author":"K\u00f3m\u00e1r","year":"2014","journal-title":"Nat. Phys."},{"key":"mlstadeefabib7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/JSTQE.2015.2392076","article-title":"Inside quantum repeaters","volume":"21","author":"Munro","year":"2015","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"mlstadeefabib8","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","article-title":"A single quantum cannot be cloned","volume":"299","author":"Wootters","year":"1982","journal-title":"Nature"},{"key":"mlstadeefabib9","doi-asserted-by":"publisher","first-page":"5932","DOI":"10.1103\/PhysRevLett.81.5932","article-title":"Quantum repeaters: the role of imperfect local operations in quantum communication","volume":"81","author":"Briegel","year":"1998","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1103\/RevModPhys.83.33","article-title":"Quantum repeaters based on atomic ensembles and linear optics","volume":"83","author":"Sangouard","year":"2011","journal-title":"Rev. Mod. Phys."},{"key":"mlstadeefabib11","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.95.045006","article-title":"Quantum repeaters: from quantum networks to the quantum internet","volume":"95","author":"Azuma","year":"2023","journal-title":"Rev. Mod. Phys."},{"key":"mlstadeefabib12","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","article-title":"Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels","volume":"70","author":"Bennett","year":"1993","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib13","doi-asserted-by":"publisher","first-page":"4287","DOI":"10.1103\/PhysRevLett.71.4287","article-title":"Event-ready-detectors\u2019 Bell experiment via entanglement swapping","volume":"71","author":"\u017bukowski","year":"1993","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib14","article-title":"On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations","author":"Goodenough","year":"2024"},{"key":"mlstadeefabib15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.012608","article-title":"Improved analytical bounds on delivery times of long-distance entanglement","volume":"105","author":"Coopmans","year":"2022","journal-title":"Phys. Rev. A"},{"key":"mlstadeefabib16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.023086","article-title":"Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible","volume":"5","author":"Kamin","year":"2023","journal-title":"Phys. Rev. Res."},{"key":"mlstadeefabib17","article-title":"Entanglement swapping for repeater chains with finite memory sizes","author":"Dai","year":"2021"},{"key":"mlstadeefabib18","article-title":"On the analysis of quantum repeater chains with sequential swaps","author":"de Andrade","year":"2024"},{"key":"mlstadeefabib19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.128.150502","article-title":"Optimal entanglement swapping in quantum repeaters","volume":"128","author":"Shchukin","year":"2022","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-023-00713-9","article-title":"Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs","volume":"9","author":"I\u00f1esta","year":"2023","journal-title":"npj Quantum Inf."},{"key":"mlstadeefabib21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.21.024041","article-title":"Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning","volume":"21","author":"Haldar","year":"2024a","journal-title":"Phys. Rev. Appl."},{"key":"mlstadeefabib22","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abfc93","article-title":"Optimizing entanglement generation and distribution using genetic algorithms","volume":"6","author":"da Silva","year":"2021","journal-title":"Quantum Sci. Technol."},{"key":"mlstadeefabib23","article-title":"Design and demonstration of an operating system for executing applications on quantum network nodes","author":"Donne","year":"2024"},{"key":"mlstadeefabib24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.108.012406","article-title":"Deep reinforcement learning for key distribution based on quantum repeaters","volume":"108","author":"Rei\u00df","year":"2023","journal-title":"Phys. Rev. A"},{"key":"mlstadeefabib25","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aab31b","article-title":"Parameter regimes for a single sequential quantum repeater","volume":"3","author":"Rozp\u0119dek","year":"2018","journal-title":"Quantum Sci. Technol."},{"key":"mlstadeefabib26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2021.3099003","article-title":"Efficient optimization of cutoffs in quantum repeater chains","volume":"2","author":"Li","year":"2021","journal-title":"IEEE Trans. Quantum Eng."},{"key":"mlstadeefabib27","doi-asserted-by":"crossref","DOI":"10.21203\/rs.3.rs-4397221\/v1","article-title":"Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies","author":"Haldar","year":"2024b"},{"key":"mlstadeefabib28","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1038\/35106500","article-title":"Long-distance quantum communication with atomic ensembles and linear optics","volume":"414","author":"Duan","year":"2001","journal-title":"Nature"},{"key":"mlstadeefabib29","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/s41586-018-0200-5","article-title":"Deterministic delivery of remote entanglement on a quantum network","volume":"558","author":"Humphreys","year":"2018","journal-title":"Nature"},{"key":"mlstadeefabib30","author":"Nielsen","year":"2010"},{"key":"mlstadeefabib31","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1126\/science.abg1919","article-title":"Realization of a multinode quantum network of remote solid-state qubits","volume":"372","author":"Pompili","year":"2021","journal-title":"Science"},{"key":"mlstadeefabib32","doi-asserted-by":"publisher","DOI":"10.1116\/5.0024062","article-title":"Tools for quantum network design","volume":"3","author":"Azuma","year":"2021","journal-title":"AVS Quantum Sc."},{"key":"mlstadeefabib33","doi-asserted-by":"publisher","DOI":"10.1116\/5.0084653","article-title":"On the design and analysis of near-term quantum network protocols using Markov decision processes","volume":"4","author":"Khatri","year":"2022","journal-title":"AVS Quantum Sci."},{"key":"mlstadeefabib34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032322","article-title":"Waiting time in quantum repeaters with probabilistic entanglement swapping","volume":"100","author":"Shchukin","year":"2019","journal-title":"Phys. Rev. A"},{"key":"mlstadeefabib35","article-title":"Reinforcement learning: an introduction","author":"Sutton","year":"2020","edition":"2nd edn"},{"key":"mlstadeefabib36","doi-asserted-by":"publisher","DOI":"10.4233\/uuid:90d06f1d-4f23-48cc-8f96-51500258020f","article-title":"Tools for the design of quantum repeater networks","author":"Coopmans","year":"2021"},{"key":"mlstadeefabib37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.131.050601","article-title":"Approximate autonomous quantum error correction with reinforcement learning","volume":"131","author":"Zeng","year":"2023","journal-title":"Phys. Rev. Lett."},{"key":"mlstadeefabib38","article-title":"Quantum circuit discovery for fault-tolerant logical state preparation with reinforcement learning","author":"Zen","year":"2024"},{"key":"mlstadeefabib39","article-title":"Tackling decision processes with non-cumulative objectives using reinforcement learning","author":"N\u00e4gele","year":"2024"},{"key":"mlstadeefabib40","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"mlstadeefabib41","first-page":"1","article-title":"Stable-baselines 3: reliable reinforcement learning implementations","volume":"22","author":"Raffin","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"mlstadeefabib42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.12.011059","article-title":"Model-free quantum control with reinforcement learning","volume":"12","author":"Sivak","year":"2022","journal-title":"Phys. Rev. X"},{"key":"mlstadeefabib43","article-title":"The surprising effectiveness of PPO in cooperative, multi-agent games","author":"Yu","year":"2022"},{"key":"mlstadeefabib44","doi-asserted-by":"publisher","first-page":"5157","DOI":"10.1038\/s41598-023-32349-2","article-title":"Quantum architecture search via truly proximal policy optimization","volume":"13","author":"Zhu","year":"2023","journal-title":"Sci. Rep."},{"key":"mlstadeefabib45","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/ad76f7","article-title":"Optimizing ZX-diagrams with deep reinforcement learning","volume":"5","author":"N\u00e4gele","year":"2024","journal-title":"Mach. Learn.: Sci. Technol."},{"key":"mlstadeefabib46","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.84.042331","article-title":"Arbitrarily complete Bell-state measurement using only linear optical elements","volume":"84","author":"Grice","year":"2011","journal-title":"Phys. Rev. A"},{"key":"mlstadeefabib47","first-page":"pp 183","article-title":"Multi-agent reinforcement learning: an overview","author":"Bu\u015foniu","year":"2010"},{"key":"mlstadeefabib48","first-page":"321","article-title":"Multi-agent reinforcement learning: a selective overview of theories and algorithms","author":"Zhang","year":"2021"},{"key":"mlstadeefabib49","article-title":"From classical to quantum shannon theory","author":"Wilde","year":"2019"},{"key":"mlstadeefabib50","doi-asserted-by":"publisher","DOI":"10.1063\/5.0009745","article-title":"Log-Convex set of Lindblad semigroups acting on N-level system","volume":"62","author":"Shahbeigi","year":"2021","journal-title":"J. Math. Phys."},{"key":"mlstadeefabib51","article-title":"Gymnasium documentation"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:01:54Z","timestamp":1754485314000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/adeefa"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,6]]},"references-count":51,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,8,6]]},"published-print":{"date-parts":[[2025,9,30]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/adeefa","relation":{},"ISSN":["2632-2153"],"issn-type":[{"value":"2632-2153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,6]]},"assertion":[{"value":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2025 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2025-02-10","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2025-07-11","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2025-08-06","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}