Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
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.
Versions
Related
- Arbitrary high-dimensional entanglement purification with the superposition of paths
- The Sample Complexity of Quantum Entanglement Allocation
- Many-body entanglement quantification in arbitrary states through a few partial-transpose moments
- Blind Remote Implementation of Arbitrary Two-Qubit Unitary Operation via Pre-Shared Entanglement
- Entanglement Allocation for Quantum Integrated Sensing and Communication
BibTeX
@misc{goisman2026efficient,
title = {{Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks}},
author = {Zachary Goisman and Matthew L. Stevens and Maxwell Goisman and Taman Truong and Gayane Vardoyan and Don Towsley and Nicholas A. Peters and Nageswara S. V. Rao and Guoliang Xue and Joseph M. Lukens},
howpublished = {arXiv},
year = {2026},
month = jul,
doi = {10.48550/arxiv.2607.15465},
eprint = {2607.15465},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.15465},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
AU - Zachary Goisman
AU - Matthew L. Stevens
AU - Maxwell Goisman
AU - Taman Truong
AU - Gayane Vardoyan
AU - Don Towsley
AU - Nicholas A. Peters
AU - Nageswara S. V. Rao
AU - Guoliang Xue
AU - Joseph M. Lukens
PY - 2026
DA - 2026/07/16
PB - arXiv
DO - 10.48550/arxiv.2607.15465
UR - https://arxiv.org/abs/2607.15465
AB - 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.
ER -