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 Transactions on Network and Service Management

Design of Survivable Entanglement Path Provisioning Under Node Failures in Quantum Networks

Eiji Oki, Masaki Maeda, Ryuta Shiraki

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Quantum networks enable end-to-end quantum communication by leveraging inherently probabilistic processes, such as distributing entanglement between distant nodes and performing entanglement swapping at intermediate repeater nodes. Existing work has focused on maximizing the entanglement path success probability under link failures. However, the occurrence of physical node failures poses a significantly greater challenge to maintaining stable entanglement connections. To tackle this problem, it is necessary to develop a path provisioning design model that can preserve a high end-to-end entanglement success probability despite the occurrence of node failures. This paper proposes a survivable path provisioning design model to determine node- disjoint entanglement paths in quantum networks, which takes into account both the link-level transmission success probabilities and the node-level entanglement swapping success probabilities at nodes. The proposed model aims to maximize the entanglement path success probability for survivability under node failure. We express the proposed design model in the form of an integer linear programming problem. Numerical results show that the proposed model attains greater survivability compared with the baseline algorithms.

DOI
10.1109/tnsm.2026.3728093

Related papers

Modeling and Analysis of Entanglement Path Provisioning for Survivability under Link Failure

Masaki Maeda, Ryuta Shiraki, Eiji Oki

Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a provisioning model to find link- disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. The numerical results indicate that the proposed model achieves higher survivability than baseline algorithms.

Asia-Pacific Network Operations and Management Symposium (APNOMS)•Sep 22, 2025•3 citations

Survivable Entanglement Path Provisioning for Quantum Networks Under Link Failures

Eiji Oki, Masaki Maeda, Ryuta Shiraki

Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a survivable provisioning model to find link-disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. We prove that the decision version of the entanglement link-disjoint path finding problem in the proposed model is NP-complete. The numerical results indicate that the proposed model achieves up to 11.8% higher survivability than baseline algorithms. While the proposed model incurs longer computation time than the baselines, the required time is still within a feasible range; in our experiments, the maximum computation time is 4.1 seconds. Network operators perform path provisioning in advance of service initiation.

IEEE Open Journal of the Communications Society•Jan 1, 2026•2 citations

Efficient Routing Design Based on Entanglement Flow Loss Effect in Quantum Networks

Zhaoying Wang, Jian Li, Zhonghui Li +4 more

The fundamental technology for the construction of large-scale quantum networks lies in the efficient distribution of remote entanglement among quantum nodes. Entanglement routing tackles the challenge of path selection between two distant end nodes and realizes entanglement distribution through multi-hop entanglement swapping. Given the inherent probability of swapping, entanglement distribution flow always presents inevitable losses. The existing routing works adopt a parallel swapping mode, which only considers the final end-to-end distribution loss effect. This lag of failure detection and complete independence between swapping reduce distribution efficiency. We observe that the sequential swapping mode can improve this defect, but it is not thorough. Thus, in this paper, we explore the entanglement flow loss effect in the sequential entanglement swapping (Loss-SES) process in order to perceive failures earlier and save network resources. Subsequently, we introduce a novel metric to quantify path performance, namely the expected entanglement throughput (EET). Building upon EET, we propose the entanglement routing algorithm MaxEET adapted to the Loss-SES process to maximize EET. For efficient deployment, in the single-request scenario, we determine the optimal routing initiation direction by introducing a bidirectional routing mechanism. In the multi-request scenario, we design a greedy and contention-free iterative routing algorithm to exhaust resources. Based on extensive simulations, the results show the superiority of our proposed Loss-SES mode compared to other modes in terms of throughput, fairness, and utilization.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•5 citations

Computing an Optimal Entanglement Path With Throughput and Fidelity Considerations

Guoliang Xue, Nageswara S. V. Rao, Don Towsley +7 more

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing an end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics is NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

IEEE Transactions on Networking•Jan 1, 2026•0 citations

Redundant Entanglement Provisioning and Selection for Throughput Maximization in Quantum Networks

Yangming Zhao, Chunming Qiao

Quantum communication using qubits based on the principle of entangled photons is a promising solution to improve network security. However, it is difficult to successfully create an entanglement link or connection between two nodes, especially when they are far apart from each other. In addition, only one qubit can be exchanged over an established entanglement connection, resulting in a low throughput.In this paper, we propose Redundant Entanglement Pro-visioning and Selection (REPS) to maximize the throughput for multiple source-destination (SD) pairs in a circuit-switched, multi-hop quantum network. REPS has two distinct features: (i). It provisions backup resources for extra entanglement links between adjacent nodes for failure-tolerance; and (ii). It provides flexibility in selecting successfully created entanglement links to establish entanglement connections for the SD pairs to achieve network-wide optimization. Extensive analysis and simulations show that REPS can achieve optimal routing with a high probability, and improves the throughput by up to 68.35% over the highest-performing algorithms in existence. In addition, it also improves the fairness among the SD pairs in the networks.

IEEE Conference on Computer Communications (INFOCOM)•May 10, 2021•126 citations

Multipartite Entanglement Routing Design in Quantum Networks

Imran Ahmed, Yudai Ogata, Eiji Oki

Quantum networks enable secure communication and distributed quantum computation using entanglement, quantum teleportation, and the no-cloning theorem. Future quantum networks will support multiparty applications such as multiparty quantum key distribution and quantum secret sharing, which require simultaneous entanglement distribution among multiple users. Therefore, efficient routing that accounts for quantum network constraints is crucial for practical multiparty quantum communications. Although bipartite entanglement routing has been studied extensively, multipartite entanglement routing with probabilistic quantum link generation and fusion operations remains inadequately addressed. This paper proposes a routing model for multipartite entanglement distribution that explicitly incorporates the probabilistic nature of quantum operations and maximizes the probability of successfully distributing a Greenberger-Horne-Zeilinger (GHZ) state to all requesting users under practical quantum network constraints. We formulate this model as a mixed-integer linear programming (MILP) problem. We prove that finding the optimal Steiner entanglement tree under the proposed model is NP-hard. For large-scale scenarios where MILP becomes computationally intractable, we develop a heuristic approach. Numerical results demonstrate that the proposed model achieves a higher entanglement tree success probability and greater robustness than baseline methods across diverse network conditions, including scenarios with stringent quantum memory constraints and large terminal sets.

IEEE Transactions on Network and Service Management•Jan 1, 2026•0 citations
Quantum networks enable end-to-end quantum communication by leveraging inherently probabilistic processes, such as distributing entanglement between distant nodes and performing entanglement swapping at intermediate repeater nodes. Existing work has focused on maximizing the entanglement path success probability under link failures. However, the occurrence of physical node failures poses a significantly greater challenge to maintaining stable entanglement connections. To tackle this problem, it is necessary to develop a path provisioning design model that can preserve a high end-to-end entanglement success probability despite the occurrence of node failures. This paper proposes a survivable path provisioning design model to determine node- disjoint entanglement paths in quantum networks, which takes into account both the link-level transmission success probabilities and the node-level entanglement swapping success probabilities at nodes. The proposed model aims to maximize the entanglement path success probability for survivability under node failure. We express the proposed design model in the form of an integer linear programming problem. Numerical results show that the proposed model attains greater survivability compared with the baseline algorithms.
Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a provisioning model to find link- disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. The numerical results indicate that the proposed model achieves higher survivability than baseline algorithms.
Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a survivable provisioning model to find link-disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. We prove that the decision version of the entanglement link-disjoint path finding problem in the proposed model is NP-complete. The numerical results indicate that the proposed model achieves up to 11.8% higher survivability than baseline algorithms. While the proposed model incurs longer computation time than the baselines, the required time is still within a feasible range; in our experiments, the maximum computation time is 4.1 seconds. Network operators perform path provisioning in advance of service initiation.
The fundamental technology for the construction of large-scale quantum networks lies in the efficient distribution of remote entanglement among quantum nodes. Entanglement routing tackles the challenge of path selection between two distant end nodes and realizes entanglement distribution through multi-hop entanglement swapping. Given the inherent probability of swapping, entanglement distribution flow always presents inevitable losses. The existing routing works adopt a parallel swapping mode, which only considers the final end-to-end distribution loss effect. This lag of failure detection and complete independence between swapping reduce distribution efficiency. We observe that the sequential swapping mode can improve this defect, but it is not thorough. Thus, in this paper, we explore the entanglement flow loss effect in the sequential entanglement swapping (Loss-SES) process in order to perceive failures earlier and save network resources. Subsequently, we introduce a novel metric to quantify path performance, namely the expected entanglement throughput (EET). Building upon EET, we propose the entanglement routing algorithm MaxEET adapted to the Loss-SES process to maximize EET. For efficient deployment, in the single-request scenario, we determine the optimal routing initiation direction by introducing a bidirectional routing mechanism. In the multi-request scenario, we design a greedy and contention-free iterative routing algorithm to exhaust resources. Based on extensive simulations, the results show the superiority of our proposed Loss-SES mode compared to other modes in terms of throughput, fairness, and utilization.
Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing an end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics is NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.
Quantum communication using qubits based on the principle of entangled photons is a promising solution to improve network security. However, it is difficult to successfully create an entanglement link or connection between two nodes, especially when they are far apart from each other. In addition, only one qubit can be exchanged over an established entanglement connection, resulting in a low throughput.In this paper, we propose Redundant Entanglement Pro-visioning and Selection (REPS) to maximize the throughput for multiple source-destination (SD) pairs in a circuit-switched, multi-hop quantum network. REPS has two distinct features: (i). It provisions backup resources for extra entanglement links between adjacent nodes for failure-tolerance; and (ii). It provides flexibility in selecting successfully created entanglement links to establish entanglement connections for the SD pairs to achieve network-wide optimization. Extensive analysis and simulations show that REPS can achieve optimal routing with a high probability, and improves the throughput by up to 68.35% over the highest-performing algorithms in existence. In addition, it also improves the fairness among the SD pairs in the networks.
Quantum networks enable secure communication and distributed quantum computation using entanglement, quantum teleportation, and the no-cloning theorem. Future quantum networks will support multiparty applications such as multiparty quantum key distribution and quantum secret sharing, which require simultaneous entanglement distribution among multiple users. Therefore, efficient routing that accounts for quantum network constraints is crucial for practical multiparty quantum communications. Although bipartite entanglement routing has been studied extensively, multipartite entanglement routing with probabilistic quantum link generation and fusion operations remains inadequately addressed. This paper proposes a routing model for multipartite entanglement distribution that explicitly incorporates the probabilistic nature of quantum operations and maximizes the probability of successfully distributing a Greenberger-Horne-Zeilinger (GHZ) state to all requesting users under practical quantum network constraints. We formulate this model as a mixed-integer linear programming (MILP) problem. We prove that finding the optimal Steiner entanglement tree under the proposed model is NP-hard. For large-scale scenarios where MILP becomes computationally intractable, we develop a heuristic approach. Numerical results demonstrate that the proposed model achieves a higher entanglement tree success probability and greater robustness than baseline methods across diverse network conditions, including scenarios with stringent quantum memory constraints and large terminal sets.