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

arXiv:2605.04767

Scheduling Concurrent Entanglement Requests in Quantum Networks

Gongyu Ni, Lester Ho

quant-phSubmitted May 6, 2026• Announced May 7, 2026• 0 citations• Revised Jul 31, 2026 (v2)
v1 · May 6, 2026v2 · Jul 31, 2026
arXivHTMLPDF

Abstract

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.

Related papers

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

Efficient Concurrent GHZ State Distribution in Quantum Networks

Charles Cao, Weisheng Si, Jong Youl Choi +1 more

Distributing multipartite entanglement, particularly Greenberger-Horne-Zeilinger (GHZ) states, across quantum networks presents unique challenges due to the stochastic nature of link-level entanglement generation and the resource constraints of quantum memories. Existing approaches typically rely on static pre-planning and single-request processing, which fail to adapt to real-time network conditions and handle concurrent demands efficiently. This paper introduces a novel two-level framework that addresses these limitations: (1) a Multi-Armed Bandit (MAB) approach using Thompson Sampling to dynamically allocate entanglement-generation capacity across network links based on observed success rates, and (2) a concurrency-aware scheduling system that manages multiple simultaneous GHZ requests under memory constraints. Our evaluation demonstrates that this integrated approach achieves a considerable reduction in GHZ state generation latency compared to static allocation strategies. In non-stationary network environments, our MAB-based algorithm automatically shifts resource allocation, maintaining optimal throughput where static approaches fail. For concurrent requests, our scheduling achieves considerably faster performance than traditional FIFO approaches by minimizing resource conflicts between concurrent requests. The framework's ability to balance exploration and exploitation through Thompson Sampling, combined with its resource-guided scheduling, provides a robust foundation for scalable quantum networking applications across dynamically changing environments.

IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)•May 1, 2026•0 citations

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

Quantum Network Routing Design with Dynamic Requests Scheduling in Multi-User Environments

Xinrui Liu, Ruidong Li

Scheduling in quantum networks involves strategically allocating quantum resources to maximize entanglement distribution efficiency and overall performance. Unlike classical networks, quantum systems lack conventional buffering mechanisms, making traditional scheduling paradigms less effective. Existing quantum network algorithms predominantly focus on routing algorithms to identify optimal entanglement paths, often neglecting timeslot scheduling for mitigating resource contention and transmission latency, particularly under multi-user environments. To address these challenges, we propose a routing algorithm tightly integrated with priority-based dynamic scheduling. The algorithm not only discovers efficient entanglement paths but also optimizes resource utilization for concurrent requests. Simulation results confirm that this approach conserves quantum resources, reduces latency, and substantially boosts network performance, providing a robust solution for multi-user quantum environments.

International Wireless Communications and Mobile Computing Conference (IWCMC)•May 12, 2025•1 citation

Entangled Resource Allocation Algorithm for Quantum Networks

Jincheng Zhang

This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.

•Aug 31, 2026•0 citations

Effective Entanglement Scheduling in Quantum Networks Via Deep Reinforcement Learning

Xun Wang, Longbo Huang, John C. S. Lui

Quantum entanglement is the cornerstone of quantum network communication, yet the qubit resources required to establish it are severely limited. Moreover, users within the network impose strict delay constraints on entanglement requests due to various factors, such as the real-time requirements of upper-layer applications or the finite coherence time of userside quantum memories. Consequently, effectively scheduling scarce qubit resources to serve these time-sensitive requests presents a significant challenge. This difficulty is exacerbated by the partial observability of quantum systems and the time-varying nature of qubit generation rates, rendering traditional scheduling algorithms ineffective. Furthermore, while Deep Reinforcement Learning (DRL) offers a promising avenue for quantum network optimization, existing research primarily focuses on network-layer routing, overlooking the finer-grained entanglement scheduling problem subject to strict delay and resource constraints. To bridge this gap, we propose the Deep Quantum Request Scheduler (DQRS), a novel DRL-based algorithm designed to maximize service quality under these dual constraints. Specifically, DQRS integrates a spatio-temporal branching architecture and virtual action slots within an ActorCritic framework. This design enables robust scheduling with continuous actions while adaptively managing fluctuating qubit budgets. Extensive simulation results demonstrate that DQRS achieves up to 44 % performance improvement over traditional methods and a 4 % gain compared to state-of-the-art DRL benchmarks across various resource constraints and observability settings, validating the robustness of the proposed approach.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations
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 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.
Distributing multipartite entanglement, particularly Greenberger-Horne-Zeilinger (GHZ) states, across quantum networks presents unique challenges due to the stochastic nature of link-level entanglement generation and the resource constraints of quantum memories. Existing approaches typically rely on static pre-planning and single-request processing, which fail to adapt to real-time network conditions and handle concurrent demands efficiently. This paper introduces a novel two-level framework that addresses these limitations: (1) a Multi-Armed Bandit (MAB) approach using Thompson Sampling to dynamically allocate entanglement-generation capacity across network links based on observed success rates, and (2) a concurrency-aware scheduling system that manages multiple simultaneous GHZ requests under memory constraints. Our evaluation demonstrates that this integrated approach achieves a considerable reduction in GHZ state generation latency compared to static allocation strategies. In non-stationary network environments, our MAB-based algorithm automatically shifts resource allocation, maintaining optimal throughput where static approaches fail. For concurrent requests, our scheduling achieves considerably faster performance than traditional FIFO approaches by minimizing resource conflicts between concurrent requests. The framework's ability to balance exploration and exploitation through Thompson Sampling, combined with its resource-guided scheduling, provides a robust foundation for scalable quantum networking applications across dynamically changing environments.
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.
Scheduling in quantum networks involves strategically allocating quantum resources to maximize entanglement distribution efficiency and overall performance. Unlike classical networks, quantum systems lack conventional buffering mechanisms, making traditional scheduling paradigms less effective. Existing quantum network algorithms predominantly focus on routing algorithms to identify optimal entanglement paths, often neglecting timeslot scheduling for mitigating resource contention and transmission latency, particularly under multi-user environments. To address these challenges, we propose a routing algorithm tightly integrated with priority-based dynamic scheduling. The algorithm not only discovers efficient entanglement paths but also optimizes resource utilization for concurrent requests. Simulation results confirm that this approach conserves quantum resources, reduces latency, and substantially boosts network performance, providing a robust solution for multi-user quantum environments.
This paper presents a novel algorithm for optimizing the allocation of entangled resources within quantum networks. The core of the approach lies in employing a reinforcement learning (RL) framework to dynamically manage and distribute entanglement, addressing the inherent challenges of maximizing utilization and enhancing quantum communication efficiency. Unlike traditional static allocation methods, the proposed RL agent learns optimal allocation strategies through iterative interaction with a simulated quantum network environment. The algorithm considers factors such as node connectivity, qubit availability, and communication delays to minimize resource wastage and improve overall network performance. The key performance indicator (KPI) is the entanglement fidelity between communicating nodes. The developed algorithm offers a promising pathway towards realizing the full potential of quantum networks by intelligently managing their most valuable asset: entanglement. The primary goal is to achieve higher fidelity entanglement distribution and improved communication rates. The effectiveness of the algorithm is evaluated through simulations, demonstrating its ability to outperform existing allocation schemes in various network topologies and operational scenarios.
Quantum entanglement is the cornerstone of quantum network communication, yet the qubit resources required to establish it are severely limited. Moreover, users within the network impose strict delay constraints on entanglement requests due to various factors, such as the real-time requirements of upper-layer applications or the finite coherence time of userside quantum memories. Consequently, effectively scheduling scarce qubit resources to serve these time-sensitive requests presents a significant challenge. This difficulty is exacerbated by the partial observability of quantum systems and the time-varying nature of qubit generation rates, rendering traditional scheduling algorithms ineffective. Furthermore, while Deep Reinforcement Learning (DRL) offers a promising avenue for quantum network optimization, existing research primarily focuses on network-layer routing, overlooking the finer-grained entanglement scheduling problem subject to strict delay and resource constraints. To bridge this gap, we propose the Deep Quantum Request Scheduler (DQRS), a novel DRL-based algorithm designed to maximize service quality under these dual constraints. Specifically, DQRS integrates a spatio-temporal branching architecture and virtual action slots within an ActorCritic framework. This design enables robust scheduling with continuous actions while adaptively managing fluctuating qubit budgets. Extensive simulation results demonstrate that DQRS achieves up to 44 % performance improvement over traditional methods and a 4 % gain compared to state-of-the-art DRL benchmarks across various resource constraints and observability settings, validating the robustness of the proposed approach.