IEEE Conference on Computer Communications (INFOCOM)
AEPA: Adaptive Entanglement Pre-Allocation for Low-Latency Quantum Repeater Networks
Hao Chen, Baoxia Du, Ruidong Li
Abstract
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.