Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Solving Routing and Spectrum Allocation in Arbitrary Flex-Grid Quantum Networks

Zachary Goisman, Matthew L. Stevens, T. K. Truong, Gayane Vardoyan, Don Towsley, Nicholas A. Peters, Nageswara S. V. Rao, Guoliang Xue, Joseph M. Lukens

Published Jan 1, 2026• 0 citations
Publisher

Abstract

We develop and demonstrate a practical pipeline to solve the routing and spectrum allocation problem for arbitrary repeaterless flex-grid quantum networks based on frequency-polarization hyperentangled photons.
DOI
10.1364/cleo_fs.2026.fth3d.5

Related papers

Flex-grid spectrum allocation for entanglement distribution in quantum networks

Navin B. Lingaraju, Hsuan‐Hao Lu, Suparna Seshadri +3 more

We adapt flex-grid spectrum allocation concepts from classical networking to entanglement distribution in a quantum network and accommodate different network usage scenarios like disparate channel loss and requests for differentiated service.

OSA Quantum 2.0 Conference•Jan 1, 2020•0 citations

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

Zachary Goisman, Matthew L. Stevens, Maxwell Goisman +7 more

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.

quant-pharXiv:2607.15465•Optics Express•Jul 20, 2026•0 citations

Wavelength contention in an entanglement network

Muneer Alshowkan, Hsuan‐Hao Lu, Joseph M. Lukens +1 more

We investigate spectral resource contention between two entangled photon sources sharing the same wavelength, demonstrating measurable fidelity impact and providing insights that enable more efficient spectral management in flex-grid quantum networks.

•Jan 1, 2026•0 citations

Optimal resource allocation for flexible-grid entanglement distribution networks

Jude Alnas, Muneer Alshowkan, Nageswara S. V. Rao +2 more

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

arXiv:2204.06642•Optics Express•Jun 14, 2022•16 citations

Routing and Wavelength Assignment for Entanglement Swapping in Photonic Quantum Networks

Yangyu Wang, Yangming Zhao, Hongli Xu +2 more

IEEE Transactions on Networking•Jan 1, 2026•0 citations

Optimizing resource allocation in flex-grid entanglement distribution networks

Jude Alnas, Muneer Alshowkan, Shrisha Rao +2 more

We introduce a model for the distribution of frequency-polarization hyper-entangled photon pairs in a flexible-grid optical network. In order to optimize entanglement fidelity and entangled bit rate, we apply a genetic algorithm to determine the proper spectrum allocation.© 2022 The Author(s)

IEEE Photonics Conference•Nov 1, 2022•0 citations
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.
We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.