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 Networking

Efficient Quantum Link Selection and Fidelity Estimation Under Success Rate Constraints

Maoli Liu, Zhuohua Li, Xuchuang Wang, John C. S. Lui

Published Jan 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ton.2026.3730646

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

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

Fidelity-Threshold Online Path Selection and Request Scheduling in Quantum Networks

Zhuoyue Chen, Kechao Cai, Wenkang Cen +2 more

Quantum networks are a promising technology for supporting a wide range of quantum applications with diverse service requirements, such as high fidelity, low end-to-end (E2E) latency, and high entanglement rate. However, in practice, the fidelity of entanglement is often unknown. Existing studies primarily focus on estimating fidelity and selecting the highest-fidelity path, but often overlook other application-specific requirements. To address this limitation, we propose Variance-aware Fidelity Threshold Path Selection (VaFTPS), an efficient candidate path selection algorithm that identifies paths satisfying fidelity requirements. VaFTPS exploits a key property of fidelity estimation: higher-fidelity paths yield lower-variance benchmarking measurements. It adopts a mean-variance reward formulation within a multi-armed bandit (MAB) framework. Based on benchmarking results, VaFTPS estimates entanglement fidelity of paths and eliminates paths unlikely to satisfy the fidelity threshold using a tailored confidence interval, thereby reducing resource consumption. To further support differentiated service, we design a request scheduling strategy that allocates requests to the selected candidate paths to maximize the total service rate for multiple requests while satisfying the fidelity, E2E latency, and entanglement rate requirements. Extensive experiments in NetSquid show that our approach efficiently identifies paths satisfying the fidelity requirement and provides differentiated service for various requests.

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•0 citations

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

Shun Yamachika, Yuto Kakihara, Shota Inoue +1 more

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.

IEEE Annual International Computer Software and Applications Conference (COMPSAC)•Jul 1, 2026•0 citations

Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning

Anthony Gatti, Anoosha Fayyaz, Prashant Krishnamurthy +2 more

Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their $k$-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across hops. On synthetic 100-node topologies with heterogeneous link fidelity and stochastic BBPSSW purification, Q-GUARD raises the qualified success rate from under 20\% to over 85\% on 4-hop paths and nearly doubles the qualified service radius in Euclidean distance relative to throughput-only and naive-purification baselines, while Q-GUARD-WS provides additional throughput gains under high hardware heterogeneity.

cs.NICross-listedarXiv:2605.00246•May 4, 2026•1 citation

QLSel: Demonstrating Efficient High-Fidelity Link Selection for Quantum Networks in the Wild

Tingting Li, Ziming Zhao, Jianwei Yin

As an emerging technology, quantum networks have the potential to revolutionize secure communication and data transmission technologies. In the Noisy Intermediate-Scale Quantum (NISQ) era, quantum noise causing low fidelity remains challenging in quantum networks. In this paper, we propose QLSel, an efficient selection algorithm for the high-fidelity link in the wild without assumptions about the fidelity distribution. We design the tailored link exploration strategy and link selection probability based on the coefficient of variation and Thompson sampling, to cope with the exploration-exploitation trade-off dilemma in the Multi-Armed Bandit (MAB) problem (for problem modeling). Extensive experiments demonstrate that QLSel significantly outperforms existing representative methods. Our codes and video are available at https://github.com/Secbrain/QLSel.

ACM Annual International Conference on Mobile Computing and Networking (MobiCom)•Dec 4, 2024•4 citations
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.
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.
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.
Quantum networks are a promising technology for supporting a wide range of quantum applications with diverse service requirements, such as high fidelity, low end-to-end (E2E) latency, and high entanglement rate. However, in practice, the fidelity of entanglement is often unknown. Existing studies primarily focus on estimating fidelity and selecting the highest-fidelity path, but often overlook other application-specific requirements. To address this limitation, we propose Variance-aware Fidelity Threshold Path Selection (VaFTPS), an efficient candidate path selection algorithm that identifies paths satisfying fidelity requirements. VaFTPS exploits a key property of fidelity estimation: higher-fidelity paths yield lower-variance benchmarking measurements. It adopts a mean-variance reward formulation within a multi-armed bandit (MAB) framework. Based on benchmarking results, VaFTPS estimates entanglement fidelity of paths and eliminates paths unlikely to satisfy the fidelity threshold using a tailored confidence interval, thereby reducing resource consumption. To further support differentiated service, we design a request scheduling strategy that allocates requests to the selected candidate paths to maximize the total service rate for multiple requests while satisfying the fidelity, E2E latency, and entanglement rate requirements. Extensive experiments in NetSquid show that our approach efficiently identifies paths satisfying the fidelity requirement and provides differentiated service for various requests.
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.
Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their kkk-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across hops. On synthetic 100-node topologies with heterogeneous link fidelity and stochastic BBPSSW purification, Q-GUARD raises the qualified success rate from under 20\% to over 85\% on 4-hop paths and nearly doubles the qualified service radius in Euclidean distance relative to throughput-only and naive-purification baselines, while Q-GUARD-WS provides additional throughput gains under high hardware heterogeneity.
As an emerging technology, quantum networks have the potential to revolutionize secure communication and data transmission technologies. In the Noisy Intermediate-Scale Quantum (NISQ) era, quantum noise causing low fidelity remains challenging in quantum networks. In this paper, we propose QLSel, an efficient selection algorithm for the high-fidelity link in the wild without assumptions about the fidelity distribution. We design the tailored link exploration strategy and link selection probability based on the coefficient of variation and Thompson sampling, to cope with the exploration-exploitation trade-off dilemma in the Multi-Armed Bandit (MAB) problem (for problem modeling). Extensive experiments demonstrate that QLSel significantly outperforms existing representative methods. Our codes and video are available at https://github.com/Secbrain/QLSel.