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

IEEE International Conference on Network Protocols (ICNP)

From Entanglement Purification Scheduling to Fidelity-Constrained Entanglement Routing

Ziyue Jia, Lin Chen

Published Oct 28, 2024• 8 citations
Publisher

Abstract

Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the singlehop case and analyze the PURIFY-AND-SWAP strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomialtime algorithm constructing an$\epsilon$-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.

DOI
10.1109/icnp61940.2024.10858500

Related papers

From Entanglement Purification Scheduling to Fidelity-constrained Multi-Flow Routing

Ziyue Jia, Lin Chen

Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the single-hop case and analyze the \textsc{purify-and-swap} strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomial-time algorithm constructing an $ε$-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.

arXiv:2408.08243•Aug 15, 2024•2 citations

On Optimum Entanglement Purification Scheduling in Quantum Networks

Lin Chen, Ziyue Jia

Entanglement purification is a fundamental operation to combat against quantum decoherence and improve the fidelity of the entanglement. When multiple rounds of entanglement purification are performed, the fidelity of the final entanglement depends on the way how we schedule entanglement purification operations at each round. In this paper, we formulate and analyze the optimal entanglement purification scheduling problem arising from this context. Our main results include an optimal link-level purification scheduling algorithm and a joint entanglement purification scheduling and routing algorithm to establish fidelity-guaranteed end-to-end entanglements with quasi-optimal throughput in quantum networks. Our algorithmic framework developed in this paper can serve as functional building blocks for entanglement provisioning to support high-fidelity quantum information transfer by exploiting the limited quantum resources in a cost-effective way in order to fully realize the unrivalled capabilities offered by quantum networks.

IEEE Journal on Selected Areas in Communications•Mar 21, 2024•22 citations

Swapping and Purification Scheme Optimization for Entanglement Distribution in Quantum Networks

Jiyao Liu, Xinwen Zhang, Xinliang Wei +4 more

Swapping and purification are the two fundamental building blocks for high-fidelity entanglement distribution in multi-hop quantum networks. Unfortunately, it is still a mystery how they intertwine with each other to affect the fidelity and cost of end-to-end entanglements. Current scheduling algorithms consider this problem under relatively limited assumptions and a critical yet unjustified conjecture. In this work, we first consider more general assumptions with operation failures and, accordingly, extend a tree-based modeling for joint swapping and purification. Then, we analytically prove the previous conjecture that the optimal strategy underBinary systemis always to purify the entanglements before any swapping. This sheds light on the protocol and device design for quantum networks. We then further propose a tree-based algorithm, which can efficiently schedule swapping and purification along a path for bothBinaryandWerner systems. Extensive simulations of the proposed method against state-of-the-art solutions show that our method uses fewer entanglements to establish qualified end-to-end entanglements, and thus achieves higher network throughput.

IEEE Transactions on Networking•Jan 1, 2026•1 citation

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•0 citations

Fidelity-Guarantee Entanglement Routing in Quantum Networks

Jian Li, Mingjun Wang, Qidong Jia +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 (SD) 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. Then we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and rerouting process for multiple routing requests. To verify the effectiveness and superiority of the proposed algorithms, extensive simulations are conducted, and the simulation results show that the proposed algorithms not only can provide fidelity-guarantee 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•Nov 15, 2021•3 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•31 citations
Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the singlehop case and analyze the PURIFY-AND-SWAP strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomialtime algorithm constructing anϵ\epsilonϵ-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.
Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the single-hop case and analyze the \textsc{purify-and-swap} strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomial-time algorithm constructing an εεε-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.
Entanglement purification is a fundamental operation to combat against quantum decoherence and improve the fidelity of the entanglement. When multiple rounds of entanglement purification are performed, the fidelity of the final entanglement depends on the way how we schedule entanglement purification operations at each round. In this paper, we formulate and analyze the optimal entanglement purification scheduling problem arising from this context. Our main results include an optimal link-level purification scheduling algorithm and a joint entanglement purification scheduling and routing algorithm to establish fidelity-guaranteed end-to-end entanglements with quasi-optimal throughput in quantum networks. Our algorithmic framework developed in this paper can serve as functional building blocks for entanglement provisioning to support high-fidelity quantum information transfer by exploiting the limited quantum resources in a cost-effective way in order to fully realize the unrivalled capabilities offered by quantum networks.
Swapping and purification are the two fundamental building blocks for high-fidelity entanglement distribution in multi-hop quantum networks. Unfortunately, it is still a mystery how they intertwine with each other to affect the fidelity and cost of end-to-end entanglements. Current scheduling algorithms consider this problem under relatively limited assumptions and a critical yet unjustified conjecture. In this work, we first consider more general assumptions with operation failures and, accordingly, extend a tree-based modeling for joint swapping and purification. Then, we analytically prove the previous conjecture that the optimal strategy underBinary systemis always to purify the entanglements before any swapping. This sheds light on the protocol and device design for quantum networks. We then further propose a tree-based algorithm, which can efficiently schedule swapping and purification along a path for bothBinaryandWerner systems. Extensive simulations of the proposed method against state-of-the-art solutions show that our method uses fewer entanglements to establish qualified end-to-end entanglements, and thus achieves higher network throughput.
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.
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 (SD) 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. Then we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and rerouting process for multiple routing requests. To verify the effectiveness and superiority of the proposed algorithms, extensive simulations are conducted, and the simulation results show that the proposed algorithms not only can provide fidelity-guarantee 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.
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.