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

• URL: http://arxiv.org/abs/2607.15465v1
• Date: Thu, 16 Jul 2026 21:20:35 GMT
• Title: Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
• Abstract summary: We present a three-stage pipeline for efficient user-to-user frequency allocation in a quantum network.<n>We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology.
• Score: 11.448612804302783
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Exact Resource Laws for Passive Wavelength Routing in Entanglement Networks [0.0]
  Entanglement-based networks provide a scalable framework for quantum communication by passively routing spectrally correlated photon pairs.<n>We address the problem through the network's connectivity graph, where the wavelength assignment becomes a resource-optimization problem.<n>We formulate the BBM92 quantum key distribution (QKD) secret-key-rate analysis for a continuous-wave-pumped broadband source.
  arXiv  Detail & Related papers  (2026-08-30T17:12:37Z)
• Enhancing the teleportation fidelity of a quantum network using purification [0.0]
  Complex quantum networks can support a diverse set of long-range entanglement distribution schemes.<n>We compare the resourcefulness of quantum networks under two distinct entanglement distribution schemes.<n> purification-based approaches can substantially enhance average teleportation fidelity, thereby improving the overall teleportation capability of quantum networks.
  arXiv  Detail & Related papers  (2026-06-17T06:43:45Z)
• Scheduling Entanglement Flows in Multi-channel Quantum Networks [0.0]
  This paper addresses resource allocation for entanglement distribution in multi-channel quantum networks.<n>A system model is proposed that integrates a multi-channel quantum network architecture with heterogeneous link characteristics.
  arXiv  Detail & Related papers  (2026-05-06T11:15:29Z)
• Unrolled Neural Networks for Constrained Optimization [83.29547301151177]
  Our framework comprises two coupled neural networks that jointly approximate the saddle point of the Lagrangian.<n>We numerically evaluate the framework on mixed-integer quadratic programs and power allocation in wireless networks.
  arXiv  Detail & Related papers  (2026-01-24T03:12:41Z)
• Communication-Efficient Federated Learning by Quantized Variance Reduction for Heterogeneous Wireless Edge Networks [55.467288506826755]
  Federated learning (FL) has been recognized as a viable solution for local-privacy-aware collaborative model training in wireless edge networks.<n>Most existing communication-efficient FL algorithms fail to reduce the significant inter-device variance.<n>We propose a novel communication-efficient FL algorithm, named FedQVR, which relies on a sophisticated variance-reduced scheme.
  arXiv  Detail & Related papers  (2025-01-20T04:26:21Z)
• Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems [10.434368470402935]
  optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime.<n>This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems.
  arXiv  Detail & Related papers  (2025-01-17T15:10:22Z)
• Optimal resource allocation for flexible-grid entanglement distribution networks [0.0]
  We introduce 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.
  arXiv  Detail & Related papers  (2022-04-13T21:31:47Z)
• Optimal Power Allocation for Rate Splitting Communications with Deep Reinforcement Learning [61.91604046990993]
  This letter introduces a novel framework to optimize the power allocation for users in a Rate Splitting Multiple Access network. In the network, messages intended for users are split into different parts that are a single common part and respective private parts.
  arXiv  Detail & Related papers  (2021-07-01T06:32:49Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.