arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.14404quant-phcs.MAcs.RO
收藏

纠缠重连:Bell非定域性在网络上移动Agent中的一种可能应用

Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks

Gdańsk University of Technology(格但斯克工业大学);University of Gdańsk(格但斯克大学)

Piotr Mironowicz

摘要:

重新安排是一个古老的问题,确保两个或两个以上的当事人,最初分离,不知道对方的位置,不允许通信,满足没有预先协议的会议地点。这个问题已经在经典计算机科学中得到了广泛的研究,并且对于现代应用(如在敌方领土上协调一支无人机舰队)具有非常重要的意义。量子非定域性,如贝尔不等式破坏,已经表明在许多情况下,与经典源相比,量子纠缠允许两个分离的方的改进的协调。在许多情况下,非信号相关性甚至加强了这种现象。在这项工作中,我们分析,如何贝尔非局部性可以使用的非对称位置感知代理试图会合在一个有限的网络上,有限的步骤。我们为使用量子资源的代理和仅具有“经典”计算能力的代理提供了这个问题的最佳解决方案。我们的研究结果表明,对于三次图和循环,它是可能的,以获得优势,允许代理使用纠缠量子态的援助。

英文摘要:

Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, meet without pre-agreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern applications like coordinating a fleet of drones in an enemy's territory. Quantum non-locality, like Bell inequality violation, has shown that in many cases quantum entanglement allows for improved coordination of two separated parties compared to classical sources. The non-signaling correlations in many cases even strengthened such phenomena. In this work, we analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. We provide the optimal solution to this problem for both agents using quantum resources, and agents with only ``classical'' computing power. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use assistance of entangled quantum states.

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

↑