IEEE Transactions on Communications
Achieving Load-Balanced Entanglement Distribution in Quantum Networks
Zhuoyue Chen, Kechao Cai, Jinbei Zhang, John C. S. Lui
Abstract
Entanglement distribution, which relies on entanglement routing and swapping strategies, is a fundamental task in quantum networks. However, existing routing algorithms often overutilize the quantum memory of nodes along shortest paths and neglect imbalanced memory utilization across different nodes, thereby increasing the risk of end-to-end (E2E) entanglement failures for subsequent requests. Moreover, suboptimal swapping strategies can further exacerbate memory imbalance among nodes. In this paper, we study load-balanced entanglement distribution to improve the resilience of quantum networks. We first propose abottleneck node modelthat captures shared quantum memory constraints at each node. Based on this model, we formulate theload-balanced entanglement distributionproblem, which aims to optimize routing decisions and swapping strategies to balance memory utilization. We prove the problem to be NP-hard and develop a decomposition-based approach that separates path finding and quantum memory allocation for sequential request processing. Based on this decomposition, we propose LBER (Load-Balanced Entanglement Routing), a polynomial-time heuristic that distributes entanglement across multiple paths. We further design an adaptive swapping strategy, AdapSwap, to determine the optimal swapping order along each path. Extensive simulations show that our approach significantly improves load balance and increases the request satisfaction ratio by 7.69%∼32.14%.