Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks

Quantum Physics arXiv:2607.15465 (quant-ph) [Submitted on 16 Jul 2026] Title:Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks Authors:Zachary Goisman, Matthew L. Stevens, Maxwell Goisman, Taman Truong, Gayane Vardoyan, Don Towsley, Nicholas A. Peters, Nageswara S. V. Rao, Guoliang Xue, Joseph M. Lukens View a PDF of the paper titled Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks, by Zachary Goisman and 9 other authors View PDF HTML (experimental) Abstract:As practical quantum networks approach large-scale deployment, the need for efficient user-to-user frequency allocation is increasing, yet current approaches only provide partial solutions to the routing and spectrum allocation problem for an arbitrary quantum network. We address this challenge for repeater-less flex-grid quantum networks based on hyperentangled photons using an efficient three-stage pipeline combining leading tools in classical networking with recent advances in numerical optimization. First, double instantiations of Yen's algorithm obtain low-loss route candidates between each pair of users and the entanglement sources. Second, the advanced process optimizer (APOPT) obtains frequency channel allocations that maximize distribution rates under fidelity constraints. Finally, the constraint programming solver using satisfiability methods (CP-SAT) assigns specific frequency bins to each link, ensuring that there is no contention between frequencies from different sources. We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology, realizing significant improvements over prior genetic algorithm approaches in speed, accuracy, and scalability. Overall, this pipeline provides an efficient heuristic workflow for optimizing broadband entanglement distribution, applicable to arbitrarily connected quantum networks integrated within the existing lightwave infrastructure. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2607.15465 [quant-ph] (or arXiv:2607.15465v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2607.15465 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Zachary Goisman [view email] [v1] Thu, 16 Jul 2026 21:20:35 UTC (796 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks, by Zachary Goisman and 9 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-07 References & Citations INSPIRE HEP NASA ADSGoogle 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?)