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.
Comment on "Relativity of Quantum States in Entanglement Swapping: Violation of Bell's Inequality with no Entanglement"
在最近的一篇有趣的文章中,克里斯·内格勒、埃布贝丘克武·O。IloOkeke,Peter P. Rohde,Jonathan P. Dowling和Tim Byrnes讨论了一个纠缠交换实验,该实验使用了一个可以切换测量时间顺序的设置。我想提请大家注意,前两份文件提出了同样的想法,并简要讨论了与这一主题有关的一些重要问题。
Enhancing the teleportation fidelity of a quantum network using purification
Centre for Quantum Science and Technology, International Institute of Information Technology, Hyderabad(海得拉巴国际信息研究院量子科学与技术中心);Department of Physics and Center of excellence in Quantum information, computation, science and technology, Indian Institute of Technology Bombay(孟买印度理工学院物理系及量子信息、计算、科学与技术卓越中心);Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad(海得拉巴国际信息研究院安全、理论与算法研究中心)