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 International Conference on Computer and Communications (ICCC)

Threshold-Based Memory Resource Allocation for Entanglement Distribution in Quantum Communication Networks

Zihao Wang, Yu Liu, Xiaosong Yu

Published Dec 12, 2025• 0 citations
Publisher

Abstract

Efficient quantum memory management is a critical challenge for large-scale entanglement distribution networks, where the probabilistic nature of entanglement generation and finite memory coherence time often cause asynchronous link completion and severe resource blocking. To address this problem, we propose a Threshold-Driven Dual-Mode Allocation (TDDMA) scheme that adaptively switches between pre-allocation and ondemand allocation according to a configurable success-probability threshold. The algorithm dynamically classifies links into highreliability and low-reliability categories. High-success-probability links are pre-allocated at the beginning of each attempt to guarantee continuity, while soft links allocate memory only when entanglement generation succeeds, releasing unused memories immediately after failure. This dual-mode mechanism effectively balances reliability and utilization by minimizing idle occupation without compromising end-to-end success probability. We develop a simulation framework on 64 -node grid and ring topologies to evaluate the proposed scheme. Results show that TDDMA achieves up to$\mathbf{4 5. 7 \%}$lower blocking probability and$\mathbf{7 - 8 \%}$higher effective memory utilization compared with the static End-to-End Reservation Allocation (EERA) baseline. Moreover, TDDMA demonstrates robust adaptability under varying traffic loads and link success distributions, maintaining stable performance even near network saturation.

DOI
10.1109/iccc68654.2025.11438093

Related papers

AEPA: Adaptive Entanglement Pre-Allocation for Low-Latency Quantum Repeater Networks

Hao Chen, Baoxia Du, Ruidong Li

Quantum repeater networks rely on timely and high-fidelity entanglement, yet conventional on-demand schemes initiate entanglement generation only after receiving request, leading to substantial time-to-service (TTS) delays due to generation and purification processes. Pre-generating entanglement pairs can mitigate such delay, but determining appropriate per-link preparation levels remains challenging: excessive preparation wastes quantum memory and accelerates decoherence, whereas insufficient preparation causes shortages along frequently used paths. To address this issue, we propose AEPA, an adaptive entanglement pre-allocation framework that employs Deep Reinforcement Learning (DRL) to dynamically adjust link-level pre-generation targets based on traffic patterns, topology characteristics, inventory states, and expiration indicators. AEPA maintains fresh entanglement on heavily used links while avoiding unnecessary generation on lightly loaded ones, thereby reducing TTS and improving overall resource-utilization efficiency. Experiments using a Time-to-Live (TTL)–based repeater model indicate that AEPA can achieve competitive performance across diverse traffic conditions, offering approximately 10–25 % higher success rates, 40–70% lower latency, and 10–25% better memory-efficiency compared with several baseline strategies.

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

DRM-ETP: A Dynamic Rate Matching-Based Entanglement Transport Protocol in Quantum Networks

Jian Li, Zhaoying Wang, Kaiping Xue +5 more

The entanglement transport protocol with a connection-oriented mode ensures the reliable distribution of remote entanglement by reserving dedicated resources on the selected path for users in a quantum network. In most existing protocols, entanglement generation and resource allocation operate with the support of global network-synchronized time slot. However, such synchronization in a large-scale quantum network is challenging, and the idealized time slot model is not conducive to continuous and concurrent requests. Meanwhile, different link performance in memory capacity and entanglement generation rate brings out critical issues, such as long distribution delay and low resource utilization, which has not been adequately addressed by the existing protocols relying on a heuristic adoption of TCP-like transport modes. In light of these observations, we propose a dynamic rate matching-based entanglement transport protocol called DRM-ETP, which allocates different memory units on each link along an entanglement distribution path. Moreover, DRM-ETP incorporates periodic forward and backward interactions to implement fine-grained feedback and a dynamic memory allocation based on priority differentiation. These mechanisms mitigate congestion and unfairness arising from resource contention among burst requests on shared links. Extensive simulation results demonstrate that DRM-ETP significantly outperforms the existing protocols in terms of throughput and resource utilization, with less distribution delay and higher fidelity. Moreover, DRM-ETP exhibits rapid and fair convergence when handling burst requests. Our study opens up possibilities for deploying efficient entanglement transport in quantum networks, thereby holding the promise of enhanced compatibility and novel functionality.

IEEE Transactions on Networking•Dec 5, 2024•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

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

Pre-established Entanglement Distribution with Time-Guaranteed Memory Cells Selection in Quantum Networks

Yazi Wang, Yongli Zhao, Xiaosong Yu +2 more

Quantum entanglement enables numerous quantum applications such as secure communication. Based on entanglement-based quantum networks, long-distance entanglement establishment between two distant end nodes is vital to realize practical quantum networks. However, due to the decoherence and imperfect quantum operations such as the non-determinism of entanglement swapping, the latency of remote entanglement distribution will be increased, simultaneously, ongoing quantum operations will be cut off caused by the short coherence time of quantum memory. In this article, we propose a pre-established entanglement distribution algorithm which contains a time-guaranteed memory cells selection algorithm, aiming to choose the maximum time-matching entangled particle in each node to establish end-to-end entanglement. Simulation results show that for the different scales of grid network topologies, all success probability values are increasing with increase the size of the memory cells and the size of the time slots. Considering constructing the large scale of quantum network, it's necessary to consider employing high multi-mode capability and long lifetime quantum memory.

IEEE International Conference on Communication Technology (ICCT)•Nov 11, 2022•1 citation

Maximizing Entanglement Rates via Efficient Memory Management in Flexible Quantum Switches

Panagiotis Promponas, Víctor Valls, Saikat Guha +1 more

We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end entanglements requests. The paper’s main contributions are (i) to characterize the switch’s capacity region and study how it scales with respect to the number of quantum memories and probability of successful LLEs and (ii) to propose a memory allocation policy that is throughput optimal. In addition, when the requests are bipartite and the LLE attempts are always successful, we show that the proposed policy has polynomial time complexity. We evaluate the proposed policy numerically and illustrate its performance depending on the requests arrivals characteristics and the time available to obtain a memory allocation.

IEEE Journal on Selected Areas in Communications•Mar 22, 2024•13 citations
Efficient quantum memory management is a critical challenge for large-scale entanglement distribution networks, where the probabilistic nature of entanglement generation and finite memory coherence time often cause asynchronous link completion and severe resource blocking. To address this problem, we propose a Threshold-Driven Dual-Mode Allocation (TDDMA) scheme that adaptively switches between pre-allocation and ondemand allocation according to a configurable success-probability threshold. The algorithm dynamically classifies links into highreliability and low-reliability categories. High-success-probability links are pre-allocated at the beginning of each attempt to guarantee continuity, while soft links allocate memory only when entanglement generation succeeds, releasing unused memories immediately after failure. This dual-mode mechanism effectively balances reliability and utilization by minimizing idle occupation without compromising end-to-end success probability. We develop a simulation framework on 64 -node grid and ring topologies to evaluate the proposed scheme. Results show that TDDMA achieves up to45.7%\mathbf{4 5. 7 \%}45.7%lower blocking probability and7−8%\mathbf{7 - 8 \%}7−8%higher effective memory utilization compared with the static End-to-End Reservation Allocation (EERA) baseline. Moreover, TDDMA demonstrates robust adaptability under varying traffic loads and link success distributions, maintaining stable performance even near network saturation.
Quantum repeater networks rely on timely and high-fidelity entanglement, yet conventional on-demand schemes initiate entanglement generation only after receiving request, leading to substantial time-to-service (TTS) delays due to generation and purification processes. Pre-generating entanglement pairs can mitigate such delay, but determining appropriate per-link preparation levels remains challenging: excessive preparation wastes quantum memory and accelerates decoherence, whereas insufficient preparation causes shortages along frequently used paths. To address this issue, we propose AEPA, an adaptive entanglement pre-allocation framework that employs Deep Reinforcement Learning (DRL) to dynamically adjust link-level pre-generation targets based on traffic patterns, topology characteristics, inventory states, and expiration indicators. AEPA maintains fresh entanglement on heavily used links while avoiding unnecessary generation on lightly loaded ones, thereby reducing TTS and improving overall resource-utilization efficiency. Experiments using a Time-to-Live (TTL)–based repeater model indicate that AEPA can achieve competitive performance across diverse traffic conditions, offering approximately 10–25 % higher success rates, 40–70% lower latency, and 10–25% better memory-efficiency compared with several baseline strategies.
The entanglement transport protocol with a connection-oriented mode ensures the reliable distribution of remote entanglement by reserving dedicated resources on the selected path for users in a quantum network. In most existing protocols, entanglement generation and resource allocation operate with the support of global network-synchronized time slot. However, such synchronization in a large-scale quantum network is challenging, and the idealized time slot model is not conducive to continuous and concurrent requests. Meanwhile, different link performance in memory capacity and entanglement generation rate brings out critical issues, such as long distribution delay and low resource utilization, which has not been adequately addressed by the existing protocols relying on a heuristic adoption of TCP-like transport modes. In light of these observations, we propose a dynamic rate matching-based entanglement transport protocol called DRM-ETP, which allocates different memory units on each link along an entanglement distribution path. Moreover, DRM-ETP incorporates periodic forward and backward interactions to implement fine-grained feedback and a dynamic memory allocation based on priority differentiation. These mechanisms mitigate congestion and unfairness arising from resource contention among burst requests on shared links. Extensive simulation results demonstrate that DRM-ETP significantly outperforms the existing protocols in terms of throughput and resource utilization, with less distribution delay and higher fidelity. Moreover, DRM-ETP exhibits rapid and fair convergence when handling burst requests. Our study opens up possibilities for deploying efficient entanglement transport in quantum networks, thereby holding the promise of enhanced compatibility and novel functionality.
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.
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 entanglement enables numerous quantum applications such as secure communication. Based on entanglement-based quantum networks, long-distance entanglement establishment between two distant end nodes is vital to realize practical quantum networks. However, due to the decoherence and imperfect quantum operations such as the non-determinism of entanglement swapping, the latency of remote entanglement distribution will be increased, simultaneously, ongoing quantum operations will be cut off caused by the short coherence time of quantum memory. In this article, we propose a pre-established entanglement distribution algorithm which contains a time-guaranteed memory cells selection algorithm, aiming to choose the maximum time-matching entangled particle in each node to establish end-to-end entanglement. Simulation results show that for the different scales of grid network topologies, all success probability values are increasing with increase the size of the memory cells and the size of the time slots. Considering constructing the large scale of quantum network, it's necessary to consider employing high multi-mode capability and long lifetime quantum memory.
We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end entanglements requests. The paper’s main contributions are (i) to characterize the switch’s capacity region and study how it scales with respect to the number of quantum memories and probability of successful LLEs and (ii) to propose a memory allocation policy that is throughput optimal. In addition, when the requests are bipartite and the LLE attempts are always successful, we show that the proposed policy has polynomial time complexity. We evaluate the proposed policy numerically and illustrate its performance depending on the requests arrivals characteristics and the time available to obtain a memory allocation.