Adaptive User-Centric Entanglement Routing in Quantum Data Networks
Abstract: Distributed quantum computing (DQC) holds immense promise in harnessing the potential of quantum computing by interconnecting multiple small quantum computers (QCs) through a quantum data network (QDN). Establishing long-distance quantum entanglement between two QCs for quantum teleportation within the QDN is a critical aspect, and it involves entanglement routing - finding a route between QCs and efficiently allocating qubits along that route. Existing approaches have mainly focused on optimizing entanglement performance for current entanglement connection (EC) requests. However, they often overlook the user's perspective, wherein the user making EC requests operates under a budget constraint over an extended period. Furthermore, both QDN resources (quantum channels and qubits) and the EC requests, reflecting the DQC workload, vary over time. In this paper, we present a novel user-centric entanglement routing problem that spans an extended period to maximize the entanglement success rate while adhering to the user's budget constraint. To address this challenge, we leverage the Lyapunov drift-plus-penalty framework to decompose the long-term optimization problem into per-slot problems, allowing us to find solutions using only the current system information. Subsequently, we develop efficient algorithms based on continuous-relaxation and Gibbs-sampling techniques to solve the per-slot entanglement routing problem. Theoretical performance guarantees are provided for both the per-slot and long-term problems. Extensive simulations demonstrate that our algorithm significantly outperforms baseline approaches in terms of entanglement success rate and budget adherence.
- A. Steane, “Quantum computing,” Reports on Progress in Physics, vol. 61, no. 2, p. 117, 1998.
- A. S. Cacciapuoti, M. Caleffi, F. Tafuri, F. S. Cataliotti, S. Gherardini, and G. Bianchi, “Quantum internet: Networking challenges in distributed quantum computing,” IEEE Network, vol. 34, no. 1, pp. 137–143, 2019.
- J. I. Cirac, A. Ekert, S. F. Huelga, and C. Macchiavello, “Distributed quantum computation over noisy channels,” Physical Review A, vol. 59, no. 6, p. 4249, 1999.
- H. Buhrman and H. Röhrig, “Distributed quantum computing,” in International Symposium on Mathematical Foundations of Computer Science. Springer, 2003, pp. 1–20.
- Y. Mao, Y. Liu, and Y. Yang, “Qubit allocation for distributed quantum computing,” in IEEE INFOCOM 2023-IEEE Conference on Computer Communications. IEEE, 2023, pp. 1–10.
- L. Yang, Y. Zhao, L. Huang, and C. Qiao, “Asynchronous entanglement provisioning and routing for distributed quantum computing,” in IEEE INFOCOM 2023-IEEE Conference on Computer Communications. IEEE, 2023.
- M. Mehic, M. Niemiec, S. Rass, J. Ma, M. Peev, A. Aguado, V. Martin, S. Schauer, A. Poppe, C. Pacher et al., “Quantum key distribution: a networking perspective,” ACM Computing Surveys (CSUR), vol. 53, no. 5, pp. 1–41, 2020.
- D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, and A. Zeilinger, “Experimental quantum teleportation,” Nature, vol. 390, no. 6660, pp. 575–579, 1997.
- W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature, vol. 299, no. 5886, pp. 802–803, 1982.
- V. Vedral, “Quantum entanglement,” Nature Physics, vol. 10, no. 4, pp. 256–258, 2014.
- L. Stephenson, D. Nadlinger, B. Nichol, S. An, P. Drmota, T. Ballance, K. Thirumalai, J. Goodwin, D. Lucas, and C. Ballance, “High-rate, high-fidelity entanglement of qubits across an elementary quantum network,” Physical review letters, vol. 124, no. 11, p. 110501, 2020.
- T. Jennewein, G. Weihs, J.-W. Pan, and A. Zeilinger, “Experimental nonlocality proof of quantum teleportation and entanglement swapping,” Physical review letters, vol. 88, no. 1, p. 017903, 2001.
- P. Hilaire, E. Barnes, S. E. Economou, and F. Grosshans, “Error-correcting entanglement swapping using a practical logical photon encoding,” Physical Review A, vol. 104, no. 5, p. 052623, 2021.
- E. Schoute, L. Mancinska, T. Islam, I. Kerenidis, and S. Wehner, “Shortcuts to quantum network routing,” arXiv preprint arXiv:1610.05238, 2016.
- M. Pant, H. Krovi, D. Towsley, L. Tassiulas, L. Jiang, P. Basu, D. Englund, and S. Guha, “Routing entanglement in the quantum internet,” npj Quantum Information, vol. 5, no. 1, p. 25, 2019.
- K. Chakraborty, F. Rozpedek, A. Dahlberg, and S. Wehner, “Distributed routing in a quantum internet,” arXiv preprint arXiv:1907.11630, 2019.
- G. Vardoyan, S. Guha, P. Nain, and D. Towsley, “On the stochastic analysis of a quantum entanglement switch,” ACM SIGMETRICS Performance Evaluation Review, vol. 47, no. 2, pp. 27–29, 2019.
- S. Shi and C. Qian, “Concurrent entanglement routing for quantum networks: Model and designs,” in Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, 2020, pp. 62–75.
- Y. Zeng, J. Zhang, J. Liu, Z. Liu, and Y. Yang, “Multi-entanglement routing design over quantum networks,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communications. IEEE, 2022, pp. 510–519.
- Y. Zhao and C. Qiao, “Redundant entanglement provisioning and selection for throughput maximization in quantum networks,” in IEEE INFOCOM 2021-IEEE Conference on Computer Communications. IEEE, 2021, pp. 1–10.
- G. Zhao, J. Wang, Y. Zhao, H. Xu, and C. Qiao, “Segmented entanglement establishment for throughput maximization in quantum networks,” in 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2022, pp. 45–55.
- Y. Zhao, G. Zhao, and C. Qiao, “E2e fidelity aware routing and purification for throughput maximization in quantum networks,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communications. IEEE, 2022, pp. 480–489.
- M. Caleffi, “Optimal routing for quantum networks,” Ieee Access, vol. 5, pp. 22 299–22 312, 2017.
- J. Li, M. Wang, K. Xue, R. Li, N. Yu, Q. Sun, and J. Lu, “Fidelity-guaranteed entanglement routing in quantum networks,” IEEE Transactions on Communications, vol. 70, no. 10, pp. 6748–6763, 2022.
- L. Yang, Y. Zhao, H. Xu, and C. Qiao, “Online entanglement routing in quantum networks,” in 2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS). IEEE, 2022, pp. 1–10.
- A. Farahbakhsh and C. Feng, “Opportunistic routing in quantum networks,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communications. IEEE, 2022, pp. 490–499.
- K. Mattle, H. Weinfurter, P. G. Kwiat, and A. Zeilinger, “Dense coding in experimental quantum communication,” Physical review letters, vol. 76, no. 25, p. 4656, 1996.
- M. A. Nielsen and I. L. Chuang, “Quantum computation and quantum information,” Phys. Today, vol. 54, no. 2, p. 60, 2001.
- S. Pirandola, J. Eisert, C. Weedbrook, A. Furusawa, and S. L. Braunstein, “Advances in quantum teleportation,” Nature photonics, vol. 9, no. 10, pp. 641–652, 2015.
- A. Dahlberg, M. Skrzypczyk, T. Coopmans, L. Wubben, F. Rozpedek, M. Pompili, A. Stolk, P. Pawelczak, R. Knegjens, J. de Oliveira Filho et al., “A link layer protocol for quantum networks,” in Proceedings of the ACM special interest group on data communication, 2019, pp. 159–173.
- E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: His Life, Work, and Legacy, 2022, pp. 287–290.
- F. Kelly, “Charging and rate control for elastic traffic,” European transactions on Telecommunications, vol. 8, no. 1, pp. 33–37, 1997.
- S. Geman and D. Geman, “Stochastic relaxation, gibbs distributions, and the bayesian restoration of images,” IEEE Transactions on pattern analysis and machine intelligence, no. 6, pp. 721–741, 1984.
- B. M. Waxman, “Routing of multipoint connections,” IEEE journal on selected areas in communications, vol. 6, no. 9, pp. 1617–1622, 1988.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.