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

Chinese Control Conference (CCC)

High-fidelity Entanglement Distribution method for Quantum Communication Network

Xin Han Sun, Tianzhu Hu, Haomin Chen, Tianze Zhu, Xiaofeng Jiang

Published Jul 28, 2024• 1 citation
Publisher

Abstract

Quantum communication technology provides an absolute security guarantee for information transmitted between quantum applications. To establish practical quantum networks, providing entangled pairs of stable quality, suitable for varying distances, is crucial. However, due to the inherent losses and imperfections of the operations during the entanglement distribution process, the fidelity of end-to-end entangled pairs will be greatly reduced. Consequently, establishing fidelity-guaranteed entangled pairs will be challenging. In this work, we introduce an entanglement distribution method that ensures the fidelity requirements of applications across different distances, while maintaining high efficiency. The method first decomposes the end-to-end fidelity requirements to target fidelity for purification at each link, based on the worst-case consumption. Then it performs multiple-round symmetrical entanglement purification based on the backup scheme to purify each entangled pair to the target value. The experimental results indicate that the scheme has acceptable performance in resource consumption and great feasibility while ensuring high efficiency.

DOI
10.23919/ccc63176.2024.10661461

Related papers

Purification Strategy Optimization for Entanglement Routing in Quantum Networks

Javier Vecino Peñas, Ana Fernández Vilas, Rebeca P. Díaz Redondo +2 more

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.

arXiv:2605.23331•IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 1, 2026•1 citation

Trace-Distance based End-to-End Entanglement Fidelity with Information Preservation in Quantum Networks

Pankaj Kumar, Binayak Kar, Shan-Hsiang Shen

Quantum networks hold the potential to revolutionize a variety of fields by surpassing the capabilities of their classical counterparts. Many of these applications necessitate the sharing of high-fidelity entangled pairs among communicating parties. However, the inherent nature of entanglement leads to an exponential decrease in fidelity as the distance between quantum nodes increases. This phenomenon makes it challenging to generate high-fidelity entangled pairs and preserve information in quantum networks. To tackle this problem, we utilized two strategies to ensure high-fidelity entangled pairs and information preservation within a quantum network. First, we use closeness centrality as a metric to identify the closest nodes in the network. Second, we introduced the trace-distance based path purification (TDPP) algorithm, specifically designed to enable information preservation and path purification entanglement routing. This algorithm identifies the shortest path within quantum networks using closeness centrality and integrates trace-distance computations for distinguishing quantum states and maintaining end-to-end (E2E) entanglement fidelity. Simulation results demonstrate that the proposed algorithm improves network throughput and E2E fidelity while preserving information compared to existing methods.

arXiv:2410.15603•Oct 21, 2024•0 citations

An Efficient Scheduling Scheme of Swapping and Purification Operations for End-to-End Entanglement Distribution in Quantum Networks

Zhaoying Wang, Jian Li, Kaiping Xue +5 more

Entanglement-based quantum networks provide unconditionally secure quantum communication by distributing end-to-end entangled pairs. To reach such goal, entanglement swapping and purification are two necessary operations, which can expand the entanglement distance and improve the fidelity of entangled pairs, respectively. During the end-to-end entanglement distribution process, the execution sequence of these two operations has a significant impact on the final performance, such as throughput and fidelity. Thus, how to schedule the sequence of swapping and purification becomes a critical problem in quantum networks. Our work focuses on such scheduling problem and we devise an efficient solution with fidelity maintenance. In our article, we first propose a concurrent swapping method for any-length path to reduce delay. Secondly, by modeling the scheduling sequence as a permutation problem, we obtain an optimal scheduling principle called “prioritized purification (PP)”. Finally, to meet the fidelity requirement of the end-to-end entangled pairs, we propose a fidelity maintenance scheme based on PP (FMSPP). The simulation results show that the proposed FMSPP can achieve higher distribution rates and less resource overhead than other scheduling solutions, and the advantages are more significant when there are more hops on the path.

IEEE Transactions on Network Science and Engineering•Jul 26, 2023•35 citations

Fidelity-Guaranteed Entanglement Routing in Quantum Networks

Jian Li, Mingjun Wang, Kaiping Xue +4 more

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.

arXiv:2111.07764•IEEE Transactions on Communications•Aug 19, 2022•154 citations

Maximization of Entanglement Sharing in Quantum Communication Networks with Fidelity Requirements

Zain Ali, Zouheir Rezki, Hamid R. Sadjadpour

The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.

Globecom•Dec 8, 2024•1 citation

Trace-distance based end-to-end entanglement fidelity with information preservation in quantum networks

Pankaj Kumar, Binayak Kar, Shan-Hsiang Shen

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.

Journal of Network and Computer Applications•Oct 18, 2025•5 citations
Quantum communication technology provides an absolute security guarantee for information transmitted between quantum applications. To establish practical quantum networks, providing entangled pairs of stable quality, suitable for varying distances, is crucial. However, due to the inherent losses and imperfections of the operations during the entanglement distribution process, the fidelity of end-to-end entangled pairs will be greatly reduced. Consequently, establishing fidelity-guaranteed entangled pairs will be challenging. In this work, we introduce an entanglement distribution method that ensures the fidelity requirements of applications across different distances, while maintaining high efficiency. The method first decomposes the end-to-end fidelity requirements to target fidelity for purification at each link, based on the worst-case consumption. Then it performs multiple-round symmetrical entanglement purification based on the backup scheme to purify each entangled pair to the target value. The experimental results indicate that the scheme has acceptable performance in resource consumption and great feasibility while ensuring high efficiency.
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 hold the potential to revolutionize a variety of fields by surpassing the capabilities of their classical counterparts. Many of these applications necessitate the sharing of high-fidelity entangled pairs among communicating parties. However, the inherent nature of entanglement leads to an exponential decrease in fidelity as the distance between quantum nodes increases. This phenomenon makes it challenging to generate high-fidelity entangled pairs and preserve information in quantum networks. To tackle this problem, we utilized two strategies to ensure high-fidelity entangled pairs and information preservation within a quantum network. First, we use closeness centrality as a metric to identify the closest nodes in the network. Second, we introduced the trace-distance based path purification (TDPP) algorithm, specifically designed to enable information preservation and path purification entanglement routing. This algorithm identifies the shortest path within quantum networks using closeness centrality and integrates trace-distance computations for distinguishing quantum states and maintaining end-to-end (E2E) entanglement fidelity. Simulation results demonstrate that the proposed algorithm improves network throughput and E2E fidelity while preserving information compared to existing methods.
Entanglement-based quantum networks provide unconditionally secure quantum communication by distributing end-to-end entangled pairs. To reach such goal, entanglement swapping and purification are two necessary operations, which can expand the entanglement distance and improve the fidelity of entangled pairs, respectively. During the end-to-end entanglement distribution process, the execution sequence of these two operations has a significant impact on the final performance, such as throughput and fidelity. Thus, how to schedule the sequence of swapping and purification becomes a critical problem in quantum networks. Our work focuses on such scheduling problem and we devise an efficient solution with fidelity maintenance. In our article, we first propose a concurrent swapping method for any-length path to reduce delay. Secondly, by modeling the scheduling sequence as a permutation problem, we obtain an optimal scheduling principle called “prioritized purification (PP)”. Finally, to meet the fidelity requirement of the end-to-end entangled pairs, we propose a fidelity maintenance scheme based on PP (FMSPP). The simulation results show that the proposed FMSPP can achieve higher distribution rates and less resource overhead than other scheduling solutions, and the advantages are more significant when there are more hops on the path.
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.
The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.
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.