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.
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.
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.
Abstract Entanglement-based quantum networks require intelligent routing mechanisms that not only maximize fidelity and connectivity but also ensure service differentiation under varying traffic conditions. In this work, we propose a novel QoS-aware traffic modeling and scheduling framework integrated into a reinforcement learning-based quantum routing agent. Unlike prior approaches that assume deterministic or uniform request arrival patterns, our model introduces stochastic and bursty traffic scenarios using Erlang and ON/OFF distributions to emulate realistic quantum workloads. Each entanglement request is assigned a set of QoS attributes, including fidelity requirements, time-to-live constraints, and priority levels. We then extend the reward function of the agent to consider deadline compliance and resource efficiency in addition to fidelity. Through simulation, we compare the proposed method against state-of-the-art baselines, including DQRA and Proactive RL, under both best-effort and QoS-prioritized scheduling modes. Results demonstrate that our approach maintains higher success rates and lower latency for high-priority requests, while preserving entanglement fidelity and efficient resource allocation across varying network loads. This study highlights the importance of integrating QoS mechanisms into quantum routing to support scalable and differentiated quantum services
Quantum networks must deliver end-to-end entanglement whose fidelity meets application requirements, which typically requires entanglement purification along multi-hop paths. Existing scheduling approaches either purify at the link level or optimize end-to-end fidelity for a static set of requests, and do not capture concurrent requests competing for network resources over time. This paper studies concurrent entanglement purification scheduling in a time-slotted quantum network with heterogeneous links, in which requests compete for link capacity and quantum memories, and each request may be served by multiple parallel paths for increased reliability. We formulate a mixed-integer linear programming (MILP) scheduler that maximizes the number of scheduled requests, with max-min path allocation as a fairness criterion, and develop reinforcement learning (RL) schedulers based on DQN, PPO, and SAC, whose rewards balance request success against Bell-pair consumption. Simulations under varying network load, topologies and target fidelity thresholds show that the RL schedulers achieve the highest success rates, improving on MILP by up to 6% and on Progressive Filling and Greedy heuristics by 16.5% and 19.5% respectively, at the cost of higher Bell pair consumption and the deferral of a small fraction of requests. MILP, in contrast, achieves the highest fairness and the lowest Bell pair consumption in most scenarios.
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.
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.
Quality of Service (QoS) has been studied in classic networks to support various applications. Due to the unique prop-erties of quantum networks, like entanglement and superposition, the definition and requirements of QoS in quantum networks differ significantly from classical networks. Limited work has been done from the application side to investigate these differences. Moreover, quantum applications exhibit distinct service requirements compared to traditional network applications, such as the need for quantum state preservation and fidelity requirements. Therefore, this work aims to analyze and model various quantum applications to identify the fundamental services required in quantum networks to provide application-specific QoS. We further propose a novel QoS routing framework, called Q2R, for quantum networks to demonstrate a possible method to achieve QoS via routing. Q2R computes feasible paths for each request and meets the fidelity and number of qubits requirements. With our framework, we can allocate resources more efficiently and our scheduling algorithm also considers fairness among different requests.