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.
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.
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.
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.
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.
Quantum Key Distribution (QKD) via quantum entanglement ensures ultra-secure communication in QKD networks. However, a fundamental challenge in these networks is the degradation of entanglement fidelity over long distances, leading to reduced key rates and inefficient resource utilization. Existing approaches primarily focus on optimizing QKD network architectures but often neglect the impact of fidelity degradation, a critical factor influencing key distribution performance. This paper proposes a novel Fidelity-Aware Routing Protocol (FARP) to maximize QKD distribution for all source-destination (SD) pair requests. FARP introduces two key components: 1) Key Path Extraction (KPE): A novel approach that formulates QKD path selection as a mixed-integer linear programming (MILP) problem to identify a set of feasible shortest paths while considering network constraints. 2) Fidelity-Aware Key Rate Distribution (FAKRD): A mechanism that optimizes key rate allocation by integrating entanglement purification, dynamically adjusting path selection based on fidelity thresholds, and mitigating quantum channel losses to enhance overall QKD efficiency. Simulation results demonstrate that the proposed FARP significantly improves key distribution performance compared to existing routing schemes, achieving higher key rates and lower qubit error rates while maintaining high-fidelity entangled connections.
Entanglement routing selects a path to establish entanglement connections between two arbitrary nodes in quan-tum networks, which plays an important role in quantum com-munication. In quantum networks, quantum decoherence and limited network performance make it challenging to distribute entangled pairs. Many entanglement routing schemes have been proposed to solve this issue but most of them are in a centralized and synchronized manner. However, they may be infeasible in large-scale quantum networks. Therefore, in this paper, we propose a distributed and asynchronous entanglement routing scheme called DFER in which quantum nodes manage requests autonomously. The major challenge is quantum nodes have little knowledge about entangled pairs, which hinders the ability to establish fidelity guaranteed entanglement connections. To ad dress this challenge, we develop DLFR algorithm which estimates the fidelity of end-to-end entanglement connections based on link-level fidelity and calculates link-level fidelity requirement based on the characteristic of purification. Among nodes which meet link-level fidelity requirement, we design DFPS path se lection algorithm to select next hop with the highest expected throughput to distribute entangled pairs. Numerous simulation results demonstrate that DFER can efficiently distribute fidelity guaranteed entangled pairs with high throughput.
Quantum networks have the potential to revolutionize communication and computation by outperforming their classical counterparts. Many quantum applications depend on the reliable distribution of high-fidelity entangled pairs between distant nodes. However, due to decoherence and channel noise, entanglement fidelity degrades exponentially with distance, posing a significant challenge to maintaining robust quantum communication. To address this, we propose two strategies to enhance end-to-end (E2E) fidelity and information preservation in quantum networks. First, we employ closeness centrality to identify optimal intermediary nodes that minimize average path length. Second, we introduce the Trace-Distance based Path Purification (TDPP) algorithm, which fuses topological and quantum state information to support fidelity-aware routing decisions. TDPP leverages closeness centrality and trace-distance to identify paths that optimize both network efficiency and entanglement fidelity. Simulation results demonstrate that our approach significantly improves network throughput and E2E entanglement fidelity, outperforming existing routing methods while enhancing information preservation.