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

arXiv:2609.38380

Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling

Sadhgun Ram Dasi, Aswath Babu H

cs.NIquant-phSubmitted Sep 29, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.

AI Summary

The paper asks how routing and scheduling should account for finite quantum-memory coherence times when congestion causes fidelity loss. It proposes a priority-dependent routing cost combining link loss with predicted propagation and queueing delays, normalized by memory coherence time. Queue estimates use an exponentially weighted moving average; three priority classes receive weights $1,2,3$. A weighted-fair-queueing argument motivates replacing queue delay by $Q/(1+P)$ in the aging model. Under its dephasing model, the stated coherence-time bound is $T_{\mathrm{mem}}\geq-k[D_{\mathrm{prop}}+Q/(1+P)]/\ln(2F_{\min}-1)$. Evaluation uses a custom discrete-event simulator on 30-node Erdős–Rényi and Barabási–Albert graphs, with $T_{\mathrm{mem}}=400\,\mu\mathrm{s}$ and $F_{\min}=0.70$. Comparisons use loss-only Dijkstra routing and FIFO scheduling. On the Erdős–Rényi topology, reported highest-priority fidelity changes from 96.08% to 96.04% as offered load increases from 20k to 180k qubits/s; Dijkstra falls from 95.26% to 81.75%. Corresponding P95 latency remains 0.055 ms versus 0.063–0.346 ms. Five-seed tests also report fidelity improvements. On the scale-free topology, highest-priority fidelity improves by 3.37–4.16 percentage points at 20k–100k qubits/s; throughput improves by 97.8% at 160k, but both metrics become worse than Dijkstra at 220k. NetSquid validation covers only the dephasing implementation, not networking behavior. Stated limitations include single-qubit rather than entanglement-distribution modeling, Markovian dephasing, fixed routing parameters, and queue-estimation lag near hub saturation. Entanglement swapping, adaptive parameters, and explicit hardware protection are left for future work.

Likely largely AI-generatedPossible errorOverclaimsMissing comparisonStrong assumptions

Central claim may not hold: The claimed WFQ delay-compression derivation violates its own conservation equation, and applying its factor to already elapsed physical time does not establish physically valid priority-dependent decoherence. The claimed attribution of QoS gains to routing rather than scheduling lacks an explicitly reported priority-scheduling control with physical aging and scheduling held fixed. The abstract combines a 4.12-percentage-point BA fidelity improvement at 20k QPS with a 97.8% throughput improvement at 160k QPS, where the fidelity improvement is only 0.50 points. The displayed routing algorithm greedily minimizes immediate edge cost without using the destination, so it does not implement the modified-Dijkstra path optimization claimed in the text. The coherence corollary evaluates to approximately 634 and 789 microseconds rather than 312 and 623, while the stated general pure-state fidelity formula and the algorithm's exponential fidelity check are also inconsistent with the specified dephasing model.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages and 3 figures

Related papers

QoS-Aware Reinforcement Learning Routing for Entanglement Networks

Diego Medeiros De Abreu, Antônio Abelém

Abstract Entanglement-based quantum networks require intelligent routing mechanisms that not only maximize fidelity and connectivity but also ensure service differentiation under varying traffic conditions. In this work, we propose a novel QoS-aware traffic modeling and scheduling framework integrated into a reinforcement learning-based quantum routing agent. Unlike prior approaches that assume deterministic or uniform request arrival patterns, our model introduces stochastic and bursty traffic scenarios using Erlang and ON/OFF distributions to emulate realistic quantum workloads. Each entanglement request is assigned a set of QoS attributes, including fidelity requirements, time-to-live constraints, and priority levels. We then extend the reward function of the agent to consider deadline compliance and resource efficiency in addition to fidelity. Through simulation, we compare the proposed method against state-of-the-art baselines, including DQRA and Proactive RL, under both best-effort and QoS-prioritized scheduling modes. Results demonstrate that our approach maintains higher success rates and lower latency for high-priority requests, while preserving entanglement fidelity and efficient resource allocation across varying network loads. This study highlights the importance of integrating QoS mechanisms into quantum routing to support scalable and differentiated quantum services

•Jan 22, 2026•0 citations

Quality of service in aggregated quantum networks

Nicoló Lo Piparo, William J. Munro, Kae Nemoto

Future quantum networks will enable the interconnection of multiple users distributed across vast geographic distances. Due to these large separations and limited physical resources, communication will often rely on multi-path routing strategies, where physical resources are distributed across channels of varying lengths and delivered to end users. Efficient long-distance quantum communication therefore requires optimizing the allocation of these resources across available paths. In this work, we introduce a performance-oriented approach to quantum network routing by extending the classical concept of Quality of Service (QoS) to the context of multi-path quantum resources distribution. Unlike prior models that consider entanglement generation or quantum memory coherence in isolation, we investigate the interplay between path assignment strategies, coherence time constraints, and quantum error correction (QEC), and how they jointly impact end-to-end communication fidelity. We analyze both unencoded and encoded transmissions over aggregated network paths, quantifying the effects of resource allocation on transmission success. Our findings show that fidelity cannot be optimized independently of memory lifetimes, and that while QEC can enhance performance under specific conditions, it also imposes additional constraints depending on network topology and path-length asymmetries. This work provides a foundation for developing QoS-aware quantum routing protocols that balance fidelity, throughput, and memory utilization -- key considerations for near-term quantum repeater networks.

arXiv:2501.18846•Physical Review A•Jul 14, 2025•1 citation

Queue-Aware Multi-Path Entanglement Distribution in r-Robust Hybrid Quantum-Classical Networks under NISQ Constraints

Shlok Goenka, Chaitanya Upadhyay, Veer Jain +1 more

Single-path entanglement routing became unstable once traffic increased and quantum memories began to expire before swapping could complete. To fix this bottleneck, we combine M/M/1 queue estimates with r-robust approach to distribute entanglement across multiple paths for hybrid quantum-classical networks under NISQ constraints. We designed a dynamic scheduler that selects only those paths whose expected delay still preserves the target fidelity. We tested the analytical bounds for stability, delay, and decoherence-induced fidelity loss through discrete-event simulations on a 60-node network. The results were promising: it showed up to 1.45 pairs/s throughput, mean fidelity above 0.90, and stable queue behavior, with 40-60% improvement over single-path routing.

International Conference on Innovations in Computational Intelligence (ICICI)•Apr 24, 2026•0 citations

Centralizing Task-based Approach to Quantum Network Control

Alexander Pirker, Robert J. Hayek, Alexander Kolar +3 more

For the last decade, layered stacks have dominated the way of reasoning about architectures for quantum networks. However, layered architectures impose stringent design and timing constraints on quantum networks, adding additional latency to the time required to serve an entanglement generation request. Moreover, increasing delays from the layered approach to network control causes degradation of state, effectively minimizing achievable fidelities. In this work we simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller. Using the SeQUeNCe quantum network simulator, we implement the centralized controller which tracks quantum memory availability across all nodes, and schedules objectives in an offline fashion using a priority-based scheduler. We evaluate the performance of this controller on multiple topologies (bottleneck, grid, star, caveman) of significant scale, with varying reservation patterns; thereby we demonstrate the viability of the resource-centric task-based quantum network control framework for scaling. Our simulation results show that the caveman and grid topologies have a higher fraction of delivered requests with low delay compared to the star topology, but with a higher fraction of highly delayed requests as well. Furthermore, we find a linear shift of the CDFs in terms of queue size for all topologies depending on the reservation delay. More interestingly, we conclude that the CDFs of priority queues for the star topology converge fast into saturation for increasing request arrival rates, demonstrating together with the other results that the framework is robust for high load scenarios in quantum networks.

quant-pharXiv:2605.03336•May 6, 2026•0 citations

QRP-CC: Congestion Control and Routing Protocols for Multi-Node Distributed Quantum Computing Networks

Shankar B B, Mahadevaswamy, B P Pradeep Kumar +3 more

Distributed quantum computing networks (DQCNs) are networks of heterogeneous quantum processors connected through entanglement links, and can handle computational tasks that are beyond the capability of a single quantum device. This means that as such networks grow past 16 nodes, the compound effects of qubit decoherence, stochastic entanglement generation, variable link fidelity, and asymmetric demands of traffic introduce severe congestion phenomena that are not considered by classical network control protocols. The paper presents QRP-CC (Quantum Routing Protocol with Congestion Control), the first unified framework to implement fidelity-aware entanglement routing, quantum token bucket rate shaping, and Quantum Random Early Detection (Q-RED) of multi-node distributed quantum computing networks. QRP-CC proposes a Fidelity-Weighted Link State (FWLS) measure that encodes the coherence time, Bell state fidelity, rate of entanglement generation, and queue occupancy into a single cost term to the Dijkstra and Bellman-Ford extensions. We demonstrate that QRP-CC maintains end-to-end fidelity of over 0.96 on paths of up to 12 hops with realistic decoherence models. A 16-node Qiskit Aer network emulator experimental evaluation shows 2.9 ms average routing latency (34x better than Q-AODV), 6,350 Mqubits/s total throughput, and 45% Byzantine fault tolerance (compared to the classical PBFT bound of 1/3). The O(N$\boldsymbol{log} \mathbf{N})$control overhead of QRP-CC makes networks with up to 256 nodes viable.

•Aug 1, 2026•0 citations

Efficient Priority-Aware Scheduling for Parallel Circuit Execution in Distributed Multi-QPU Systems

Patrick Hopf, Nils Quetschlich, Robert Wille

Distributed multi-QPU infrastructures share scarce devices across many users, making circuit scheduling a key systems-software challenge. Major providers (Amazon, Microsoft, IBM, Quantinuum) still rely on simple priority-based FIFO strategies that preserve fairness but ignore coordinated multi-QPU execution. We propose priority-aware scheduling that casts quantum circuit scheduling as a classical packing problem, integrates with distributed quantum software stacks, and is released as an open-source implementation. Experiments show a 47% reduction in makespan and a 77% throughput increase over industry FIFO, and a 23% improvement over the strongest academic baseline.

•Jun 23, 2026•0 citations
Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.
The paper asks how routing and scheduling should account for finite quantum-memory coherence times when congestion causes fidelity loss. It proposes a priority-dependent routing cost combining link loss with predicted propagation and queueing delays, normalized by memory coherence time. Queue estimates use an exponentially weighted moving average; three priority classes receive weights 1,2,31,2,31,2,3. A weighted-fair-queueing argument motivates replacing queue delay by Q/(1+P)Q/(1+P)Q/(1+P) in the aging model. Under its dephasing model, the stated coherence-time bound is Tmem≥−k[Dprop+Q/(1+P)]/ln⁡(2Fmin⁡−1)T_{\mathrm{mem}}\geq-k[D_{\mathrm{prop}}+Q/(1+P)]/\ln(2F_{\min}-1)Tmem​≥−k[Dprop​+Q/(1+P)]/ln(2Fmin​−1).
Evaluation uses a custom discrete-event simulator on 30-node Erdős–Rényi and Barabási–Albert graphs, with Tmem=400 μsT_{\mathrm{mem}}=400\,\mu\mathrm{s}Tmem​=400μs and Fmin⁡=0.70F_{\min}=0.70Fmin​=0.70. Comparisons use loss-only Dijkstra routing and FIFO scheduling. On the Erdős–Rényi topology, reported highest-priority fidelity changes from 96.08% to 96.04% as offered load increases from 20k to 180k qubits/s; Dijkstra falls from 95.26% to 81.75%. Corresponding P95 latency remains 0.055 ms versus 0.063–0.346 ms. Five-seed tests also report fidelity improvements. On the scale-free topology, highest-priority fidelity improves by 3.37–4.16 percentage points at 20k–100k qubits/s; throughput improves by 97.8% at 160k, but both metrics become worse than Dijkstra at 220k. NetSquid validation covers only the dephasing implementation, not networking behavior.
Stated limitations include single-qubit rather than entanglement-distribution modeling, Markovian dephasing, fixed routing parameters, and queue-estimation lag near hub saturation. Entanglement swapping, adaptive parameters, and explicit hardware protection are left for future work.
Abstract Entanglement-based quantum networks require intelligent routing mechanisms that not only maximize fidelity and connectivity but also ensure service differentiation under varying traffic conditions. In this work, we propose a novel QoS-aware traffic modeling and scheduling framework integrated into a reinforcement learning-based quantum routing agent. Unlike prior approaches that assume deterministic or uniform request arrival patterns, our model introduces stochastic and bursty traffic scenarios using Erlang and ON/OFF distributions to emulate realistic quantum workloads. Each entanglement request is assigned a set of QoS attributes, including fidelity requirements, time-to-live constraints, and priority levels. We then extend the reward function of the agent to consider deadline compliance and resource efficiency in addition to fidelity. Through simulation, we compare the proposed method against state-of-the-art baselines, including DQRA and Proactive RL, under both best-effort and QoS-prioritized scheduling modes. Results demonstrate that our approach maintains higher success rates and lower latency for high-priority requests, while preserving entanglement fidelity and efficient resource allocation across varying network loads. This study highlights the importance of integrating QoS mechanisms into quantum routing to support scalable and differentiated quantum services
Future quantum networks will enable the interconnection of multiple users distributed across vast geographic distances. Due to these large separations and limited physical resources, communication will often rely on multi-path routing strategies, where physical resources are distributed across channels of varying lengths and delivered to end users. Efficient long-distance quantum communication therefore requires optimizing the allocation of these resources across available paths. In this work, we introduce a performance-oriented approach to quantum network routing by extending the classical concept of Quality of Service (QoS) to the context of multi-path quantum resources distribution. Unlike prior models that consider entanglement generation or quantum memory coherence in isolation, we investigate the interplay between path assignment strategies, coherence time constraints, and quantum error correction (QEC), and how they jointly impact end-to-end communication fidelity. We analyze both unencoded and encoded transmissions over aggregated network paths, quantifying the effects of resource allocation on transmission success. Our findings show that fidelity cannot be optimized independently of memory lifetimes, and that while QEC can enhance performance under specific conditions, it also imposes additional constraints depending on network topology and path-length asymmetries. This work provides a foundation for developing QoS-aware quantum routing protocols that balance fidelity, throughput, and memory utilization -- key considerations for near-term quantum repeater networks.
Single-path entanglement routing became unstable once traffic increased and quantum memories began to expire before swapping could complete. To fix this bottleneck, we combine M/M/1 queue estimates with r-robust approach to distribute entanglement across multiple paths for hybrid quantum-classical networks under NISQ constraints. We designed a dynamic scheduler that selects only those paths whose expected delay still preserves the target fidelity. We tested the analytical bounds for stability, delay, and decoherence-induced fidelity loss through discrete-event simulations on a 60-node network. The results were promising: it showed up to 1.45 pairs/s throughput, mean fidelity above 0.90, and stable queue behavior, with 40-60% improvement over single-path routing.
For the last decade, layered stacks have dominated the way of reasoning about architectures for quantum networks. However, layered architectures impose stringent design and timing constraints on quantum networks, adding additional latency to the time required to serve an entanglement generation request. Moreover, increasing delays from the layered approach to network control causes degradation of state, effectively minimizing achievable fidelities. In this work we simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller. Using the SeQUeNCe quantum network simulator, we implement the centralized controller which tracks quantum memory availability across all nodes, and schedules objectives in an offline fashion using a priority-based scheduler. We evaluate the performance of this controller on multiple topologies (bottleneck, grid, star, caveman) of significant scale, with varying reservation patterns; thereby we demonstrate the viability of the resource-centric task-based quantum network control framework for scaling. Our simulation results show that the caveman and grid topologies have a higher fraction of delivered requests with low delay compared to the star topology, but with a higher fraction of highly delayed requests as well. Furthermore, we find a linear shift of the CDFs in terms of queue size for all topologies depending on the reservation delay. More interestingly, we conclude that the CDFs of priority queues for the star topology converge fast into saturation for increasing request arrival rates, demonstrating together with the other results that the framework is robust for high load scenarios in quantum networks.
Distributed quantum computing networks (DQCNs) are networks of heterogeneous quantum processors connected through entanglement links, and can handle computational tasks that are beyond the capability of a single quantum device. This means that as such networks grow past 16 nodes, the compound effects of qubit decoherence, stochastic entanglement generation, variable link fidelity, and asymmetric demands of traffic introduce severe congestion phenomena that are not considered by classical network control protocols. The paper presents QRP-CC (Quantum Routing Protocol with Congestion Control), the first unified framework to implement fidelity-aware entanglement routing, quantum token bucket rate shaping, and Quantum Random Early Detection (Q-RED) of multi-node distributed quantum computing networks. QRP-CC proposes a Fidelity-Weighted Link State (FWLS) measure that encodes the coherence time, Bell state fidelity, rate of entanglement generation, and queue occupancy into a single cost term to the Dijkstra and Bellman-Ford extensions. We demonstrate that QRP-CC maintains end-to-end fidelity of over 0.96 on paths of up to 12 hops with realistic decoherence models. A 16-node Qiskit Aer network emulator experimental evaluation shows 2.9 ms average routing latency (34x better than Q-AODV), 6,350 Mqubits/s total throughput, and 45% Byzantine fault tolerance (compared to the classical PBFT bound of 1/3). The O(NlogN)\boldsymbol{log} \mathbf{N})logN)control overhead of QRP-CC makes networks with up to 256 nodes viable.
Distributed multi-QPU infrastructures share scarce devices across many users, making circuit scheduling a key systems-software challenge. Major providers (Amazon, Microsoft, IBM, Quantinuum) still rely on simple priority-based FIFO strategies that preserve fairness but ignore coordinated multi-QPU execution. We propose priority-aware scheduling that casts quantum circuit scheduling as a classical packing problem, integrates with distributed quantum software stacks, and is released as an open-source implementation. Experiments show a 47% reduction in makespan and a 77% throughput increase over industry FIFO, and a 23% improvement over the strongest academic baseline.