arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.07501quant-ph
收藏

通过交换操作的实时排序优化纠缠生成

Optimized Generation of Entanglement by Real-Time Ordering of Swapping Operations

Ranjani G Sundaram, Himanshu Gupta

AI总结:

针对量子网络中纠缠对建立的高延迟问题,提出根据随机交换成败实时决定交换顺序的贪心自适应策略,在随机网络上较最优离线方法最多降低40%延迟。

摘要:

量子网络中的长距离量子通信因不可克隆定理所施加的限制而面临重大挑战。现有的大多数量子通信协议依赖于纠缠对(EP)的先验分发,而这一过程因其随机性会产生相当大的延迟。在本工作中,我们研究在量子网络中一对节点之间建立EP的延迟最小化问题。以往研究主要通过预先选择静态纠缠路由和/或交换树来最小化预期生成延迟,而我们的方法采用实时自适应策略——其中纠缠交换操作的顺序(以及因此使用的交换树)在运行时根据随机事件的实时成功/失败情况逐步确定。在此背景下,我们提出一种贪心算法,该算法基于当前网络状态,在每个阶段迭代确定要执行的最佳路由和/或纠缠交换操作。我们在随机生成的网络上评估所提方案,观察到与最优离线方法相比,延迟最多降低40%。

英文摘要:

Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement pairs (EPs), a process known to incur considerable latency due to its stochastic nature. In this work, we consider the problem of minimizing the latency of establishing an EP across a pair of nodes in a quantum network. While prior research has primarily focused on minimizing the expected generation latency by selecting {\em static} entanglement routes and/or swapping trees in advance, our approach considers a real-time adaptive strategy -- wherein the order of entanglement-swapping operations (hence, the swapping tree used) is progressively determined at runtime based on the runtime success/failure of the stochastic events. In this context, we present a greedy algorithm that iteratively determines the best route and/or entanglement-swapping operation to perform at each stage based on the current network. We evaluate our schemes on randomly generated networks and observe a reduction in latency of up to 40% from the optimal offline approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑