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

Journal of Optical Communications and Networking

Quantum relative capacity loss for online path–wavelength allocation in dynamic entanglement distribution networks

Yuzhe Zhao, Chaojie Wang, Lu Wang, Xinyi Liu, Rui Xu, 焦荣珍

Published Aug 24, 2026• 0 citations
Publisher

Abstract

Entanglement distribution networks (EDNs) require online assignment of limited wavelength resources under probabilistic entanglement generation and dynamic service arrivals. Classical residual-capacity metrics used in wavelength assignment cannot directly represent whether a quantum service request obtains a valid end-to-end entangled pair within its holding window. This paper establishes a time-slotted network-layer abstraction that maps entanglement generation, swapping, quality filtering, and purification into an end-to-end success probability. Based on this success-event serviceability measure, we propose quantum relative capacity loss (QRCL) for online path–wavelength allocation. QRCL combines threshold-based filtering with relative serviceability-loss minimization. Simulations over multiple representative topologies show that QRCL achieves robust best or near-best request success rates while maintaining competitive fairness, delay, and millisecond-level decision time.

DOI
10.1364/jocn.606967

Related papers

On the path-based entanglement purification model in online quantum networks

Joy Halder, Nayeem Ahmed, Hilal Sultan Duranoglu Tunc +3 more

In this study, we propose a resource allocation model for end-to-end (E2E) fidelity-guaranteed entanglement distribution considering novel path-based entanglement purification (PEP) model for online quantum networks. The proposed PEP model is developed by extending the existing link-based entanglement purification (LEP) model. A heuristic framework is designed for both the PEP and LEP models, consisting of two stages: (i) an E2E entanglement purification stage based on the PEP (or LEP) model, and (ii) a resource allocation stage. The resource allocation stage employs an integer linear programming (ILP) formulation for small-scale quantum networks with a limited number of requests, and a greedy-based heuristic for large-scale networks with higher request volumes. This heuristic algorithm incorporates entanglement distribution probability (EDP), entanglement swapping probability (ESP), and fidelity metrics to ensure feasibility under noisy intermediate-scale quantum (NISQ) constraints. An online traffic model is considered, where requests arrive according to a Poisson process, each with a fixed execution time and a variable deadline. A time-slotted operation framework is adopted for the quantum network. In each Bell-pair generation window, Bell pairs are generated and distributed between adjacent nodes. The duration of these windows is constrained by the decoherence time of the Bell pairs. Extensive simulations are conducted on the square-grid quantum networks of varying dimensions and parameter ranges, including different ranges of EDP, ESP, and fidelity values. The number of requests and capacity of edges (in terms of quantum channels) are also varied. Across all simulation setups, the proposed PEP model consistently outperforms the LEP model in terms of the blocking ratio (BR).

Scientific Reports•Sep 8, 2026•0 citations

Concurrent Entanglement Purification Scheduling in Dynamic Quantum Networks

Gongyu Ni, Lester Ho

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.

quant-pharXiv:2610.26900•Oct 20, 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

On the Concurrent Multipath Entanglement Distribution in Quantum Networks

Joy Halder, Emil Matúš, Gerhard Paul Fettweis

In this paper, we consider the problem of concurrent multipath routing and end-to-end entanglement distribution for online resource allocation in quantum networks. We propose a heuristic algorithm to solve this problem, considering quantum memory, decoherence time, entanglement distribution probability, and fidelity. A time-slotted quantum network operation model is considered based on the cut-off decoherence time of quantum memories. The proposed heuristic is designed for a quantum network with noisy intermediate scale quantum (NISQ) constraints, including fixed quantum memory decoherence time, and probabilistic entanglement generation and swapping. It considers integer linear programming (ILP)-based and heuristic approaches to select multiple paths and resource allocation in the network. Simulations are performed to evaluate the performance of ILP and heuristic based approaches in terms of requests using multipath approach, blocking ratio, and computation time in a small sized quantum network with few requests. Next, the performance of heuristic based approaches are evaluated for a large problem size. The obtained results ensure that performance of ILP and heuristic based approaches are comparable, and multipath routing outperforms single path routing in terms of blocking ratio.

Globecom•Dec 8, 2024•6 citations

Scheduling Concurrent Entanglement Requests in Quantum Networks

Gongyu Ni, Lester Ho

This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.

quant-pharXiv:2605.04767•May 7, 2026•0 citations

End-to-end entanglement request scheduling in quantum networks via topology-aware decision transformer

Yeong-Jun Seok, Ihsan Ullah, Youn‐Hee Han +2 more

Quantum networks represent promising foundations for secure communication, distributed quantum computing, and advanced quantum-enabled services. However, their deployment faces practical challenges including limited quantum resources, short coherence times, and environmental disturbances. Effective end-to-end entanglement request scheduling is critical to addressing these challenges, as it directly affects resource utilization and network reliability. Although end-to-end entanglement service rate is one of the representative performance measures in the quantum networks, the explicit optimization of the rate under the realistic constraints is relatively unexplored in the previous studies. This paper proposes an offline reinforcement learning (RL)-based scheduling framework, employing a decision transformer integrated with graph attention networks, to specifically optimize service rates within practical operational constraints, such as the single-time-slot usage limitation of quantum links. Our approach adaptively leverages network topology and operational dynamics to enhance scheduling decisions. Simulation studies conducted on the NetSquid platform across four quantum network topologies demonstrate that our model consistently outperforms both a conventional rule-based method and a baseline offline RL method in terms of service rate, while preserving fidelity and maintaining delays within acceptable levels. These results confirm the effectiveness of the proposed method for practical quantum network management.

Journal of Optical Communications and Networking•Nov 14, 2025•3 citations
Entanglement distribution networks (EDNs) require online assignment of limited wavelength resources under probabilistic entanglement generation and dynamic service arrivals. Classical residual-capacity metrics used in wavelength assignment cannot directly represent whether a quantum service request obtains a valid end-to-end entangled pair within its holding window. This paper establishes a time-slotted network-layer abstraction that maps entanglement generation, swapping, quality filtering, and purification into an end-to-end success probability. Based on this success-event serviceability measure, we propose quantum relative capacity loss (QRCL) for online path–wavelength allocation. QRCL combines threshold-based filtering with relative serviceability-loss minimization. Simulations over multiple representative topologies show that QRCL achieves robust best or near-best request success rates while maintaining competitive fairness, delay, and millisecond-level decision time.
In this study, we propose a resource allocation model for end-to-end (E2E) fidelity-guaranteed entanglement distribution considering novel path-based entanglement purification (PEP) model for online quantum networks. The proposed PEP model is developed by extending the existing link-based entanglement purification (LEP) model. A heuristic framework is designed for both the PEP and LEP models, consisting of two stages: (i) an E2E entanglement purification stage based on the PEP (or LEP) model, and (ii) a resource allocation stage. The resource allocation stage employs an integer linear programming (ILP) formulation for small-scale quantum networks with a limited number of requests, and a greedy-based heuristic for large-scale networks with higher request volumes. This heuristic algorithm incorporates entanglement distribution probability (EDP), entanglement swapping probability (ESP), and fidelity metrics to ensure feasibility under noisy intermediate-scale quantum (NISQ) constraints. An online traffic model is considered, where requests arrive according to a Poisson process, each with a fixed execution time and a variable deadline. A time-slotted operation framework is adopted for the quantum network. In each Bell-pair generation window, Bell pairs are generated and distributed between adjacent nodes. The duration of these windows is constrained by the decoherence time of the Bell pairs. Extensive simulations are conducted on the square-grid quantum networks of varying dimensions and parameter ranges, including different ranges of EDP, ESP, and fidelity values. The number of requests and capacity of edges (in terms of quantum channels) are also varied. Across all simulation setups, the proposed PEP model consistently outperforms the LEP model in terms of the blocking ratio (BR).
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.
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.
In this paper, we consider the problem of concurrent multipath routing and end-to-end entanglement distribution for online resource allocation in quantum networks. We propose a heuristic algorithm to solve this problem, considering quantum memory, decoherence time, entanglement distribution probability, and fidelity. A time-slotted quantum network operation model is considered based on the cut-off decoherence time of quantum memories. The proposed heuristic is designed for a quantum network with noisy intermediate scale quantum (NISQ) constraints, including fixed quantum memory decoherence time, and probabilistic entanglement generation and swapping. It considers integer linear programming (ILP)-based and heuristic approaches to select multiple paths and resource allocation in the network. Simulations are performed to evaluate the performance of ILP and heuristic based approaches in terms of requests using multipath approach, blocking ratio, and computation time in a small sized quantum network with few requests. Next, the performance of heuristic based approaches are evaluated for a large problem size. The obtained results ensure that performance of ILP and heuristic based approaches are comparable, and multipath routing outperforms single path routing in terms of blocking ratio.
This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.
Quantum networks represent promising foundations for secure communication, distributed quantum computing, and advanced quantum-enabled services. However, their deployment faces practical challenges including limited quantum resources, short coherence times, and environmental disturbances. Effective end-to-end entanglement request scheduling is critical to addressing these challenges, as it directly affects resource utilization and network reliability. Although end-to-end entanglement service rate is one of the representative performance measures in the quantum networks, the explicit optimization of the rate under the realistic constraints is relatively unexplored in the previous studies. This paper proposes an offline reinforcement learning (RL)-based scheduling framework, employing a decision transformer integrated with graph attention networks, to specifically optimize service rates within practical operational constraints, such as the single-time-slot usage limitation of quantum links. Our approach adaptively leverages network topology and operational dynamics to enhance scheduling decisions. Simulation studies conducted on the NetSquid platform across four quantum network topologies demonstrate that our model consistently outperforms both a conventional rule-based method and a baseline offline RL method in terms of service rate, while preserving fidelity and maintaining delays within acceptable levels. These results confirm the effectiveness of the proposed method for practical quantum network management.