Entanglement Distribution in Satellite-Based Dynamic Quantum Networks
Entanglement Distribution in Satellite-Based Dynamic Quantum Networks
复制标题
DOI：
10.1109/mnet.2023.3321706
复制
发表时间：
2023-06
期刊：
影响因子：
9.3
通讯作者：
A. Chang;Yinxin Wan;G. Xue;Arunabha Sen
中科院分区：
文献类型：
--
作者：
A. Chang;Yinxin Wan;G. Xue;Arunabha Sen
低地球轨道（LEO）卫星为建立全球量子信息网络提供了绝佳的机会。然而，从网络角度来看，基于卫星的纠缠分布尚未得到充分研究。现有的工作在分配纠缠时通常不考虑卫星随时间的运动和/或通常不允许沿着卫星间链路分配纠缠，这是我们在本文中解决的两个缺点。我们首先定义一个系统模型，该模型考虑卫星随时间的移动和卫星间链路。接下来，我们在此系统模型下制定最佳纠缠分布（OED）问题，并展示如何将动态物理网络中的 OED 问题转换为静态逻辑图中的问题，从而可用于解决动态物理网络中的 OED 问题。然后，我们提出了一种用于计算卫星辅助多跳纠缠路径的多项式时间贪婪算法。我们还设计了一种基于整数线性规划（ILP）的算法来计算最优解，作为研究贪心算法性能的基线。我们提出评估结果来证明我们的模型和算法的优势。
Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.