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.
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)control overhead of QRP-CC makes networks with up to 256 nodes viable.
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.
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.
Abstract Future quantum networks will have to support different applications on shared infrastructure, like fidelity-critical quantum key distribution (QKD) and latency-sensitive distributed quantum computing (DQC). The existing approaches for entanglement routing either optimise for a single application, or rely on sequential resource allocation, which results in inefficient resource utilisation, unfairness and degraded performance when multiple applications compete for shared network resources. In this paper, we propose AMARQ, a multi-objective deep Q-network based routing framework to jointly serve heterogeneous QKD and DQC traffic on shared quantum infrastructure. The agent makes adaptive and application-aware routing decisions to dynamically balance the rigid fidelity and latency requirements of QKD and the high-throughput and elastic rate requirements of DQC. The reward function combines a successful-routing throughput term with a per-edge fidelity penalty and an end-of-episode failure penalty; per-flow latency is enforced as a QoS constraint, and inter-application fairness is enforced by a dedicated admission-control loop that reserves a dynamic QKD qubit pool. We assess the performance of AMARQ on grid topologies with 25 to 625 nodes. AMARQ attains a request success ratio above 85%, which is up to 32 percentage points higher than ESDI and 39 percentage points higher than Cicconetti, while keeping the end-to-end fidelity above 0.80 and the inference latency below 90 ms for all configurations.
Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their k-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across hops. On synthetic 100-node topologies with heterogeneous link fidelity and stochastic BBPSSW purification, Q-GUARD raises the qualified success rate from under 20\% to over 85\% on 4-hop paths and nearly doubles the qualified service radius in Euclidean distance relative to throughput-only and naive-purification baselines, while Q-GUARD-WS provides additional throughput gains under high hardware heterogeneity.
Quantum computers in the noisy intermediate-scale quantum (NISQ) era are constrained by limited qubit counts, imperfect gate fidelities, and short coherence times. NISQ-era computers often have too few qubits to run many algorithms, and those that do run often have limited quantum advantage. Distributed quantum computing (DQC) is a promising approach to overcome this, where multiple quantum processors are interconnected through shared entanglement. This work serves as a system overview of an entanglement distribution system. We achieve this by examining a zero-added loss multiplexing (ZALM) entanglement generation source, simulating multi-hop, repeater-less networks, and various routing algorithms to distribute entanglement, and real-hardware quantum experiments that reconstruct entanglement links of degraded fidelity and simulate classical-communication delay. Network simulations evaluate routing and spectrum-allocation algorithms under entanglement-generation-imposed rate constraints, by evaluating both fairness and throughput across network sizes and topologies. We identify two polynomial-time approximation algorithms that perform well, or better than others under these metrics. Using both simulations and quantum hardware, we evaluate how degraded entanglement and communication latency affect teleportation-based distributed multipartite-entanglement-state construction. The results reveal the coupled influence of source rate, routing efficiency, fidelity, and classical delay on networked entanglement distribution and DQC performance, providing a reproducible framework for both experimental and simulated studies of near-term DQC.
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.