arXiv 2405.024062024-05quant-phcs.NI

量子网络中纠缠分布的异步协议分析

Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks

Shahrooz Pouryousef, Hassan Shapourian, Don Towsley

AI总结：

本文分析了量子网络中两种最小异步纠缠分布协议，发现顺序方案因性能相当且实现更简单而更具优势，并引入截止策略优化性能，在SURFnet真实拓扑中验证了结果。

摘要：

量子网络中的纠缠分布通常在理想化假设下进行研究，例如完美同步和集中控制，且往往忽略经典通信。然而，这些假设在大规模网络中并不切实际。本文通过探索两种最小异步协议提出了一个务实的视角：一种是在链路层独立生成纠缠的并行方案，另一种是迭代地将纠缠从一方扩展到另一方的顺序方案。我们的分析纳入了非均匀中继器间距和经典通信，并考虑了量子存储器退相干。我们使用基于纠缠的量子密钥分发的纠缠比特率、端到端保真度和密钥率等指标来评估网络性能。研究结果表明，顺序方案具有优越性，因为其性能与并行方案相当，且实现更简单。此外，我们引入了截止策略，通过丢弃存储器空闲时间过长的尝试来提升性能，有效消除了低质量的纠缠链路。最后，我们将方法应用于SURFnet的真实拓扑，并报告了作为存储器相干时间函数的性能表现。

英文摘要：

The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions prove impractical in large-scale networks. In this paper, we present a pragmatic perspective by exploring two minimal asynchronous protocols: a parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our analysis incorporates non-uniform repeater spacings and classical communications and accounts for quantum memory decoherence. We evaluate network performance using metrics such as entanglement bit rate, end-to-end fidelity, and secret key rate for entanglement-based quantum key distribution. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation. Additionally, we impose a cutoff strategy to improve performance by discarding attempts with prolonged memory idle time, effectively eliminating low-quality entanglement links. Finally, we apply our methods to the real-world topology of SURFnet and report the performance as a function of memory coherence time.

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

AI总结：

摘要：

英文摘要：

相关论文