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

International Conference on Innovations in Computational Intelligence (ICICI)

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

Shlok Goenka, Chaitanya Upadhyay, Veer Jain, Suresh Kumar Jha

Published Apr 24, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icici68867.2026.11565029

Related papers

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

Sadhgun Ram Dasi, Aswath Babu H

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.

cs.NICross-listedarXiv:2609.38380•Oct 1, 2026•0 citations

Fidelity- and Coherence-Aware Entanglement Routing for Regional Quantum Internet Networks

H S Ullas, A Lakshmi, H R Mithun Gowda

The quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.

International Journal of Innovative Research in Engineering•Oct 29, 2026•0 citations

Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution

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

We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing memory decoherence, while entanglement requests arrive according to Poisson and bursty ON--OFF processes. Using a queueing-theoretic framework, we couple physical-layer memory dynamics with congestion-dependent service behavior to analyze stability, delay, and fidelity trade-offs. Operating regimes are characterized in terms of the load parameter, showing that fixed cutoff policies impose a fundamental fidelity--latency trade-off together with strict stability limits. Queue-aware adaptive control strategies are then introduced that dynamically adjust memory cutoff times and the number of parallel entanglement-generation channels. Cutoff adaptation restores stability near critical load by trading fidelity for service capacity, whereas resource scaling increases capacity without degrading entanglement quality. Under bursty traffic, joint adaptation suppresses delay spikes while activating additional channels only during congestion periods. The framework is further extended to a two-user shared-resource scenario in which independent traffic flows compete for a common resource pool. Stability is determined by aggregate load, while adaptive resource redistribution stabilizes queues that diverge under fixed partitioning. These results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.

quant-pharXiv:2603.24874•Mar 27, 2026•0 citations

On the Concurrent Multipath Entanglement Distribution in Quantum Networks

Joy Halder, Emil Matúš, Gerhard Paul Fettweis

In this paper, we consider the problem of concurrent multipath routing and end-to-end entanglement distribution for online resource allocation in quantum networks. We propose a heuristic algorithm to solve this problem, considering quantum memory, decoherence time, entanglement distribution probability, and fidelity. A time-slotted quantum network operation model is considered based on the cut-off decoherence time of quantum memories. The proposed heuristic is designed for a quantum network with noisy intermediate scale quantum (NISQ) constraints, including fixed quantum memory decoherence time, and probabilistic entanglement generation and swapping. It considers integer linear programming (ILP)-based and heuristic approaches to select multiple paths and resource allocation in the network. Simulations are performed to evaluate the performance of ILP and heuristic based approaches in terms of requests using multipath approach, blocking ratio, and computation time in a small sized quantum network with few requests. Next, the performance of heuristic based approaches are evaluated for a large problem size. The obtained results ensure that performance of ILP and heuristic based approaches are comparable, and multipath routing outperforms single path routing in terms of blocking ratio.

Globecom•Dec 8, 2024•6 citations

Predictive Fidelity-Aware Routing and Adaptive Scheduling in Distributed NISQ Quantum Networks via Actor–Critic Reinforcement Learning

P. Prabu

Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.

•Jul 15, 2026•0 citations

Entanglement-Aware Adaptive Routing for Optimizing Distributed Quantum Computing over Quantum Interconnect Networks

Tianrong Ding

Distributed quantum computing (DQC) connects multiple quantum processing units (QPUs) via quantum interconnects to overcome the qubit-count and connectivity limitations of individual devices. A critical challenge in this paradigm is routing entanglement resources efficiently across the quantum interconnect network so that inter-QPU quantum gates can be executed with high fidelity and minimal resource waste. We propose the Entanglement-Aware Adaptive Routing (EAAR) framework, which jointly optimizes path selection, entanglement purification scheduling, and congestion-aware load balancing for DQC workloads. EAAR models the quantum network as a fidelity-weighted directed graph and transforms the maximum-fidelity path problem into an additive shortest-path problem. An adaptive purification scheduler targets bottleneck links when end-to-end fidelity falls below application-defined thresholds, and a dynamic congestion penalty steers traffic away from over-utilized entanglement buffers. We evaluate EAAR in simulation across grid, ring, random-regular, and small-world topologies ranging from 4 to 24 QPU nodes. Results demonstrate that EAAR improves average remote-gate fidelity by up to 10.3% and reduces entanglement consumption by up to 44.8% compared to greedy baselines, while maintaining competitive latency with shortest-path routing. These findings confirm that holistic, entanglement-aware routing is essential for practical, high-fidelity distributed quantum computation.

•Oct 31, 2026•0 citations
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.
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 quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.
We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing memory decoherence, while entanglement requests arrive according to Poisson and bursty ON--OFF processes. Using a queueing-theoretic framework, we couple physical-layer memory dynamics with congestion-dependent service behavior to analyze stability, delay, and fidelity trade-offs. Operating regimes are characterized in terms of the load parameter, showing that fixed cutoff policies impose a fundamental fidelity--latency trade-off together with strict stability limits. Queue-aware adaptive control strategies are then introduced that dynamically adjust memory cutoff times and the number of parallel entanglement-generation channels. Cutoff adaptation restores stability near critical load by trading fidelity for service capacity, whereas resource scaling increases capacity without degrading entanglement quality. Under bursty traffic, joint adaptation suppresses delay spikes while activating additional channels only during congestion periods. The framework is further extended to a two-user shared-resource scenario in which independent traffic flows compete for a common resource pool. Stability is determined by aggregate load, while adaptive resource redistribution stabilizes queues that diverge under fixed partitioning. These results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.
In this paper, we consider the problem of concurrent multipath routing and end-to-end entanglement distribution for online resource allocation in quantum networks. We propose a heuristic algorithm to solve this problem, considering quantum memory, decoherence time, entanglement distribution probability, and fidelity. A time-slotted quantum network operation model is considered based on the cut-off decoherence time of quantum memories. The proposed heuristic is designed for a quantum network with noisy intermediate scale quantum (NISQ) constraints, including fixed quantum memory decoherence time, and probabilistic entanglement generation and swapping. It considers integer linear programming (ILP)-based and heuristic approaches to select multiple paths and resource allocation in the network. Simulations are performed to evaluate the performance of ILP and heuristic based approaches in terms of requests using multipath approach, blocking ratio, and computation time in a small sized quantum network with few requests. Next, the performance of heuristic based approaches are evaluated for a large problem size. The obtained results ensure that performance of ILP and heuristic based approaches are comparable, and multipath routing outperforms single path routing in terms of blocking ratio.
Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.
Distributed quantum computing (DQC) connects multiple quantum processing units (QPUs) via quantum interconnects to overcome the qubit-count and connectivity limitations of individual devices. A critical challenge in this paradigm is routing entanglement resources efficiently across the quantum interconnect network so that inter-QPU quantum gates can be executed with high fidelity and minimal resource waste. We propose the Entanglement-Aware Adaptive Routing (EAAR) framework, which jointly optimizes path selection, entanglement purification scheduling, and congestion-aware load balancing for DQC workloads. EAAR models the quantum network as a fidelity-weighted directed graph and transforms the maximum-fidelity path problem into an additive shortest-path problem. An adaptive purification scheduler targets bottleneck links when end-to-end fidelity falls below application-defined thresholds, and a dynamic congestion penalty steers traffic away from over-utilized entanglement buffers. We evaluate EAAR in simulation across grid, ring, random-regular, and small-world topologies ranging from 4 to 24 QPU nodes. Results demonstrate that EAAR improves average remote-gate fidelity by up to 10.3% and reduces entanglement consumption by up to 44.8% compared to greedy baselines, while maintaining competitive latency with shortest-path routing. These findings confirm that holistic, entanglement-aware routing is essential for practical, high-fidelity distributed quantum computation.