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 Annual International Computer Software and Applications Conference (COMPSAC)

Demand-Aware Identification of High-Fidelity Link Sets in Quantum Networks

Shun Yamachika, Yuto Kakihara, Shota Inoue, Hiroyuki Ohsaki

Published Jul 1, 2026• 0 citations
Publisher

Abstract

Ensuring the reliability of quantum networks requires the accurate evaluation of fidelity-a metric representing link quality-and the selection of high-fidelity links. However, since fidelity estimation consumes a large number of measurements, an efficient method for identifying high-quality communication links with limited resources is desirable. Existing studies have primarily focused on identifying high-fidelity links between a pair of nodes, leaving adaptive resource allocation insufficiently explored in multi-destination environments where destinations differ in network importance (e.g., communication demand or the quantum memory capacity of nodes). In this study, we propose DaTopLinks (Demand-aware Top-$K$HighFidelity Links), a method for efficiently identifying the top-$K$destinations and their best link for each selected destination according to a utility function that combines destination importance and link fidelity. The algorithm introduces a dual-criterion link elimination mechanism that simultaneously performs intradestination link elimination and top-$K$destination elimination. It also incorporates an early confirmation mechanism that allows early termination of measurements for destinations once their inclusion in the top-$K$set and the identification of their best link are statistically guaranteed. In our theoretical analysis, we derive an upper bound on the sample complexity based on an effective gap that captures both inter-destination utility differences and intra-destination fidelity differences. Simulation results demonstrate that the proposed method functions effectively under depolarizing, dephasing, and bit-flip noise models.

DOI
10.1109/compsac69091.2026.00168

Related papers

LinkSelFiE: Link Selection and Fidelity Estimation in Quantum Networks

Maoli Liu, Zhuohua Li, Xuchuang Wang +1 more

Reliable transmission of fragile quantum information requires one to efficiently select and utilize high-fidelity links among multiple noisy quantum links. However, the fidelity, a quality metric of quantum links, is unknown a priori. Uniformly estimating the fidelity of all links can be expensive, especially in networks with numerous links. To address this challenge, we formulate the link selection and fidelity estimation problem as a best arm identification problem and propose an algorithm named LinkSelFiE. The algorithm efficiently identifies the optimal link from a set of quantum links and provides an accurate fidelity estimate of that link with low quantum resource consumption. LinkSelFiE estimates link fidelity based on the feedback of a vanilla network benchmarking subroutine, and adaptively eliminates inferior links throughout the whole fidelity estimation process. This elimination leverages a novel confidence interval derived in this paper for the estimates from the subroutine, which theoretically guarantees that LinkSelFiE outputs the optimal link correctly with high confidence. We also establish a provable upper bound of cost complexity for LinkSelFiE. Moreover, we perform extensive simulations under various scenarios to corroborate that LinkSelFiE outperforms other existing methods in terms of both identifying the optimal link and reducing quantum resource consumption.

IEEE Conference on Computer Communications (INFOCOM)•May 20, 2024•17 citations

Efficient Quantum Link Selection and Fidelity Estimation Under Success Rate Constraints

Maoli Liu, Zhuohua Li, Xuchuang Wang +1 more

Quantum networks enable secure communication across distributed quantum systems. To reliably transmit quantum information, entanglement links need to exhibit both highfidelityand sufficientsuccess rates. However, these crucial metrics are initially unknown, and estimating them uniformly across all links in large-scale quantum networks is highly resource-intensive. In this work, we address the problem of efficiently identifying the link with the highest fidelity among those satisfying a minimum success rate constraint. We formulate it as a constrained best arm identification problem and introduce two algorithms, LINKSELFIE-E and LINKSELFIE-C, built upon thenetwork benchmarkingsubroutine. To enable joint fidelity and success rate estimation, we extend network benchmarking by incorporating a minimum-variance unbiased estimator for success rates. LINKSELFIE-E is an elimination-based algorithm that iteratively removes inferior links in successive phases, while LINKSELFIE-C is a confidence-based algorithm with an interactive update mechanism, dynamically refining estimates and prioritizing benchmarking resources toward promising links. We derive confidence intervals for fidelity and success rate estimates and prove that both LINKSELFIE-E and LINKSELFIE-C identify the optimal link with high probability. We also establish upper bounds on their cost complexities, demonstrating their efficiency. Extensive simulations under various noise models show that our algorithms outperform baseline methods in both identifying the optimal link and reducing quantum resource consumption.

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

RL-QLiS: A Reinforcement Learning-Based Entanglement Link Selection Algorithm for Quantum Networks

Xinchen Wang, Jihao Fan, Renxu Wang +2 more

Accurate selection of high-fidelity quantum links is essential for ensuring reliable quantum communication over noisy networks. However, the fidelity of each link is typically unknown and must be estimated through repeated quantum benchmarking, which can incur substantial resource costs—especially in networks with multiple redundant paths. To address this challenge, we formulate the link selection and fidelity estimation task as a best-arm identification problem under the reinforcement learning framework. Based on this formulation, we propose RL-QLiS, a lightweight and adaptive link selection algorithm that efficiently allocates quantum benchmarking resources to promising links while periodically exploring others. RL-QLiS dynamically refines fidelity estimates using feedback from benchmarking subroutines and effectively balances exploration and exploitation through a Q-learning-based strategy. Unlike exhaustive methods, our approach minimizes redundant evaluations and focuses on high-potential links. Extensive simulations demonstrate that RL-QLiS consistently identifies the optimal entangled link while significantly reducing quantum resource consumption compared to existing baselines.

Information Communication Technologies Conference (ICTC)•Aug 22, 2025•0 citations

E2E Fidelity Aware Routing and Purification for Throughput Maximization in Quantum Networks

Yangming Zhao, Gongming Zhao, Chunming Qiao

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.

IEEE Conference on Computer Communications (INFOCOM)•May 2, 2022•112 citations

SFTRAP: Satisfying Fidelity Threshold Routing and Adaptive Purification for Throughput Maximum in Quantum Network

Zhi Wang, Tao Gong, Yingpu Nian +6 more

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.

IEEE Transactions on Communications•Jan 1, 2026•17 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
Ensuring the reliability of quantum networks requires the accurate evaluation of fidelity-a metric representing link quality-and the selection of high-fidelity links. However, since fidelity estimation consumes a large number of measurements, an efficient method for identifying high-quality communication links with limited resources is desirable. Existing studies have primarily focused on identifying high-fidelity links between a pair of nodes, leaving adaptive resource allocation insufficiently explored in multi-destination environments where destinations differ in network importance (e.g., communication demand or the quantum memory capacity of nodes). In this study, we propose DaTopLinks (Demand-aware Top-KKKHighFidelity Links), a method for efficiently identifying the top-KKKdestinations and their best link for each selected destination according to a utility function that combines destination importance and link fidelity. The algorithm introduces a dual-criterion link elimination mechanism that simultaneously performs intradestination link elimination and top-KKKdestination elimination. It also incorporates an early confirmation mechanism that allows early termination of measurements for destinations once their inclusion in the top-KKKset and the identification of their best link are statistically guaranteed. In our theoretical analysis, we derive an upper bound on the sample complexity based on an effective gap that captures both inter-destination utility differences and intra-destination fidelity differences. Simulation results demonstrate that the proposed method functions effectively under depolarizing, dephasing, and bit-flip noise models.
Reliable transmission of fragile quantum information requires one to efficiently select and utilize high-fidelity links among multiple noisy quantum links. However, the fidelity, a quality metric of quantum links, is unknown a priori. Uniformly estimating the fidelity of all links can be expensive, especially in networks with numerous links. To address this challenge, we formulate the link selection and fidelity estimation problem as a best arm identification problem and propose an algorithm named LinkSelFiE. The algorithm efficiently identifies the optimal link from a set of quantum links and provides an accurate fidelity estimate of that link with low quantum resource consumption. LinkSelFiE estimates link fidelity based on the feedback of a vanilla network benchmarking subroutine, and adaptively eliminates inferior links throughout the whole fidelity estimation process. This elimination leverages a novel confidence interval derived in this paper for the estimates from the subroutine, which theoretically guarantees that LinkSelFiE outputs the optimal link correctly with high confidence. We also establish a provable upper bound of cost complexity for LinkSelFiE. Moreover, we perform extensive simulations under various scenarios to corroborate that LinkSelFiE outperforms other existing methods in terms of both identifying the optimal link and reducing quantum resource consumption.
Quantum networks enable secure communication across distributed quantum systems. To reliably transmit quantum information, entanglement links need to exhibit both highfidelityand sufficientsuccess rates. However, these crucial metrics are initially unknown, and estimating them uniformly across all links in large-scale quantum networks is highly resource-intensive. In this work, we address the problem of efficiently identifying the link with the highest fidelity among those satisfying a minimum success rate constraint. We formulate it as a constrained best arm identification problem and introduce two algorithms, LINKSELFIE-E and LINKSELFIE-C, built upon thenetwork benchmarkingsubroutine. To enable joint fidelity and success rate estimation, we extend network benchmarking by incorporating a minimum-variance unbiased estimator for success rates. LINKSELFIE-E is an elimination-based algorithm that iteratively removes inferior links in successive phases, while LINKSELFIE-C is a confidence-based algorithm with an interactive update mechanism, dynamically refining estimates and prioritizing benchmarking resources toward promising links. We derive confidence intervals for fidelity and success rate estimates and prove that both LINKSELFIE-E and LINKSELFIE-C identify the optimal link with high probability. We also establish upper bounds on their cost complexities, demonstrating their efficiency. Extensive simulations under various noise models show that our algorithms outperform baseline methods in both identifying the optimal link and reducing quantum resource consumption.
Accurate selection of high-fidelity quantum links is essential for ensuring reliable quantum communication over noisy networks. However, the fidelity of each link is typically unknown and must be estimated through repeated quantum benchmarking, which can incur substantial resource costs—especially in networks with multiple redundant paths. To address this challenge, we formulate the link selection and fidelity estimation task as a best-arm identification problem under the reinforcement learning framework. Based on this formulation, we propose RL-QLiS, a lightweight and adaptive link selection algorithm that efficiently allocates quantum benchmarking resources to promising links while periodically exploring others. RL-QLiS dynamically refines fidelity estimates using feedback from benchmarking subroutines and effectively balances exploration and exploitation through a Q-learning-based strategy. Unlike exhaustive methods, our approach minimizes redundant evaluations and focuses on high-potential links. Extensive simulations demonstrate that RL-QLiS consistently identifies the optimal entangled link while significantly reducing quantum resource consumption compared to existing baselines.
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.
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.
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.