Bayesian Optimization for Repeater Protocols

[2502.02208] Bayesian Optimization for Repeater Protocols Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2502.02208 (quant-ph) [Submitted on 4 Feb 2025] Title: Bayesian Optimization for Repeater Protocols Authors: Lorenzo La Corte , Kenneth Goodenough , Ananda G. Maity , Siddhartha Santra , David Elkouss View a PDF of the paper titled Bayesian Optimization for Repeater Protocols, by Lorenzo La Corte and 3 other authors View PDF HTML (experimental) Abstract: Efficiently distributing secret keys over long distances remains a critical challenge in the development of quantum networks. "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of probabilistic entanglement generation, swapping and distillation operations. However, finding the protocol that maximizes the secret-key rate is difficult for two reasons. First, calculating the secretkey rate for a given protocol is non-trivial due to experimental imperfections and the probabilistic nature of the operations. Second, the protocol space rapidly grows with the number of nodes, and lacks any clear structure for efficient exploration. To address the first challenge, we build upon the efficient machinery developed by Li et al. [1] and we extend it, enabling numerical calculation of the secret-key rate for heterogeneous repeater chains with an arbitrary number of nodes. For navigating the large, unstructured space of repeater protocols, we implement a Bayesian optimization algorithm, which we find consistently returns the optimal result. Whenever comparisons are feasible, we validate its accuracy against results obtained through brute-force methods. Further, we use our framework to extract insight on how to maximize the efficiency of repeater protocols across varying node configurations and hardware conditions. Our results highlight the effectiveness of Bayesian optimization in exploring the potential of near-term quantum repeater chains. Comments: 8 pages, 8 figures Subjects: Quantum Physics (quant-ph) ; Networking and Internet Architecture (cs.NI) Cite as: arXiv:2502.02208 [quant-ph] (or arXiv:2502.02208v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2502.02208 Focus to learn more arXiv-issued DOI via DataCite Journal reference: In 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC) 135 (2025) Related DOI : https://doi.org/10.1109/QCNC64685.2025.00029 Focus to learn more DOI(s) linking to related resources Submission history From: Lorenzo La Corte [ view email ] [v1] Tue, 4 Feb 2025 10:46:12 UTC (188 KB) Full-text links: Access Paper: View a PDF of the paper titled Bayesian Optimization for Repeater Protocols, by Lorenzo La Corte and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2025-02 Change to browse by: cs cs.NI References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges#427471
• Transparent Interconnection of Lots of Links (TRILL): Vendor-Specific RBridge Channel Protocol#243980
• NUBO: A Transparent Python Package for Bayesian Optimization#177689
• NUBO: A Transparent Python Package for Bayesian Optimization#177209
• NUBO: A Transparent Python Package for Bayesian Optimization#176955