arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.04588quant-phcs.DC
收藏

纠缠改善了分布式系统中的协调

Entanglement improves coordination in distributed systems

Delft Networks(代尔夫特网络);QuTech, Delft University of Technology(代尔夫特理工大学 QuTech);Quantum Computer Science, EEMCS, Delft University of Technology(代尔夫特理工大学 EEMCS 量子计算机科学);Kavli Institute of Nanoscience, Delft University of Technology(代尔夫特理工大学 卡弗里纳米科学研究所)

Francisco Ferreira da Silva, Stephanie Wehner

AI总结:

针对双任务分布式系统中的协调问题,利用量子纠缠的瞬时相关性,通过排队论和非局部博弈证明纠缠辅助路由策略在基线任务吞吐量函数严格凸时实现帕累托最优,优于无通信经典策略。

摘要:

分布式系统中的协调常常受到通信延迟的阻碍,这会降低性能。量子纠缠提供了比经典方式无需通信即可实现的更强相关性。关键在于,这些相关性在测量时瞬间显现,无论系统之间的物理距离如何。我们研究了共享纠缠在包含两个服务器的分布式系统中的一个双任务优化问题中的应用。系统必须处理一个持续可用、可抢占的基线任务以及成对到达的客户请求。系统性能由基线任务吞吐量和客户等待时间之间的权衡来表征。我们提出了一个严格的分析模型,证明当基线任务吞吐量函数严格凸(奖励更长的无中断处理周期)时,与最优的无通信经典策略相比,纠缠辅助路由策略实现了帕累托更优的性能。我们通过排队论分析、非局部博弈公式和经典界限的计算验证来证明这一优势。我们的结果将分布式调度和协调确定为近期基于纠缠的量子网络的一个新应用领域。

英文摘要:

Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these correlations manifest instantaneously upon measurement, irrespective of the physical distance separating the systems. We investigate the application of shared entanglement to a dual-work optimization problem in a distributed system comprising two servers. The system must process both a continuously available, preemptible baseline task and incoming customer requests arriving in pairs. System performance is characterized by the trade-off between baseline task throughput and customer waiting time. We present a rigorous analytical model demonstrating that when the baseline task throughput function is strictly convex, rewarding longer uninterrupted processing periods, entanglement-assisted routing strategies achieve Pareto-superior performance compared to optimal communication-free classical strategies. We prove this advantage through queueing-theoretic analysis, non-local game formulation, and computational certification of classical bounds. Our results identify distributed scheduling and coordination as a novel application domain for near-term entanglement-based quantum networks.

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

↑