The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, a significant challenge lies in efficiently allocating limited resources to maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and mitigate quantum decoherence caused by inefficient routing algorithms. To address these challenges, this paper proposes a Resource-Aware Efficient Routing and Adaptive Purification (REAP-Q) strategy. REAP-Q utilizes the Batched Iterative Resource-Aware (BIRA) algorithm to perform multipath routing, thereby improving network throughput. BIRA enhances path quality through a resource-aware link cost function and increases computational efficiency by narrowing the search space using a batch-based path discovery approach. For purification, REAP-Q incorporates an Adaptive Throughput-Aware Purification (ATP) scheme, which dynamically selects purification links to minimize throughput degradation while meeting fidelity thresholds. Moreover, ATP adjusts the number of purification rounds according to the specific conditions of each path, effectively reducing purification time and improving overall algorithmic efficiency. Simulation results demonstrate that REAP-Q achieves up to 18% higher throughput than state-of-the-art methods while consistently satisfying the required E2E fidelity threshold, underscoring its potential for scalable, high-performance quantum entanglement distribution.
The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, a significant challenge lies in efficiently allocating limited resources to maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and mitigate quantum decoherence caused by inefficient routing algorithms. To address these challenges, this paper proposes a Resource-Aware Efficient Routing and Adaptive Purification (REAP-Q) strategy. REAP-Q utilizes the Batched Iterative Resource-Aware (BIRA) algorithm to perform multipath routing, thereby improving network throughput. BIRA enhances path quality through a resource-aware link cost function and increases computational efficiency by narrowing the search space using a batch-based path discovery approach. For purification, REAP-Q incorporates an Adaptive Throughput-Aware Purification (ATP) scheme, which dynamically selects purification links to minimize throughput degradation while meeting fidelity thresholds. Moreover, ATP adjusts the number of purification rounds according to the specific conditions of each path, effectively reducing purification time and improving overall algorithmic efficiency. Simulation results demonstrate that REAP-Q achieves up to 18% higher throughput than state-of-the-art methods while consistently satisfying the required E2E fidelity threshold, underscoring its potential for scalable, high-performance quantum entanglement distribution.
The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.
This paper studies reliable teleportation of quantum bits (called qubits) in a quantum data network with multiple sources (S) and destinations (D) as well as repeaters. To teleport qubits for a SD pair reliably, not only an entanglement path for the SD pair, but also appropriate purification of the links along the path is required to ensure that the end-to-end (E2E) fidelity of the established entanglement connections is high enough.This is the first work on quantifying the E2E fidelity, and also using this E2E fidelity to determine critical links to achieve the most resource efficient purification. A novel approach called E2E Fidelity aware Routing and Purification (EFiRAP) is proposed to maximize network throughput, i.e., the number of entanglement connections among multiple SD pairs, with each connection having an E2E fidelity above a given required threshold. EFiRAP accomplishes this goal by first preparing multiple candidate entanglement paths and determining optimal purification schemes, and then selecting the final set of entanglement paths that can maximize network throughput under the given quantum resource constraints. Existing works only ensured the fidelity of individual links, rather than the E2E fidelity is above a given threshold. Extensive simulations show that the proposed EFiRAP can enhance network throughput by about 50% when compared with the state-of-the-art approach.
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 rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high quality entanglement in the presence of noise, decoherence, and imperfect operations, which progressively degrade the fidelity of entangled states through entanglement swapping. Entanglement purification provides an effective mechanism to mitigate this degradation at the cost of additional resources. In this work, we study purification-aware quantum routing and formulate the problem of selecting optimal purification strategies as an optimization task. By employing dynamic programming techniques, we identify strategies that optimally balance resource consumption and end-to-end fidelity, demonstrating the effectiveness of our approach across different scenarios.
Quantum networks enable advanced applications by connecting quantum nodes through entangled qubit pairs, with entanglement routing being essential for their operation. However, maintaining high-quality entanglement across large-scale networks is challenging due to decoherence, probabilistic generation, limited memory coherence, and fidelity loss. To mitigate these issues, we adopt a zone-based architecture that logically groups nodes into manageable zones, improving scalability, efficiency, and localized entanglement distribution. We propose the Inter-Zone-Based Routing (Inter-ZBR) design, a fidelity-aware framework aimed at enabling high-fidelity entanglement distribution across the network. This Inter-ZBR framework includes three components: (i) QNetwork-Zone Formation (QNZF) algorithm, which divides large-scale networks into well-connected zones to optimize routing decisions and reduce network complexity for entanglement generation; (ii) Inter-Zone Path Selection (IZPS) algorithm, which determines the set of potential shortest paths for each Source-Destination (SD) pair; (iii) The Inter-Zone based Fidelity-Aware Entanglement Routing (IZFAER) algorithm selects optimal routing paths by evaluating entanglement generation rates to maximize network throughput, while incorporating purification techniques to ensure end-to-end fidelity in the network. Simulation results demonstrate that the Inter-ZBR framework improves network throughput by 7.45% to 11.91%, increases end-to-end fidelity by 3.52% to 4.75%, and reduces quantum memory consumption by 9.27% to 21.40%, compared to traditional entanglement routing methods.
Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (S-D) pairs in quantum networks. In our proposal, we first consider the single S-D pair scenario and design an iterative routing algorithm, Q-PATH, to find the optimal purification decisions along the routing path with minimum entangled pair cost. Further, a low-complexity routing algorithm using an extended Dijkstra algorithm, Q-LEAP, is designed to reduce the computational complexity by using a simple but effective purification decision method. Finally, we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and re-routing process for multiple routing requests. Simulation results show that the proposed algorithms not only can provide fidelity-guaranteed routing solutions, but also has superior performance in terms of throughput, fidelity of end-to-end entanglement connection, and resource utilization ratio, compared with the existing routing scheme.