论文标题
纠缠的会合：贝尔非本地性在网络上的可能应用
Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks
论文作者
论文摘要
会合是一个古老的问题，即确保两个或多个当事方最初是分开的，不知道彼此的地位，不允许交流，而没有在会议上进行预先审议的情况。这个问题已经在古典计算机科学中进行了广泛的研究，并且对现代应用程序具有生动的重要性，例如协调敌人领土上的无人机舰队。量子非局部性（如贝尔不平等）表明，与经典来源相比，量子纠缠在许多情况下可以改善两个分开的政党的协调。在许多情况下，不信号的相关性甚至加强了这种现象。在这项工作中，我们分析了如何通过试图在有限数量步骤的有限网络上对位置的非对称位置感知的代理来使用贝尔非本地性。我们使用量子资源为这两个代理提供了最佳解决方案，并且仅具有``经典''计算能力的代理。我们的结果表明，对于立方图和周期，可以通过允许代理使用纠缠量子状态的帮助来获得优势。
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.
