论文标题
用于有效纠缠分布的量子叠加网络
A Quantum Overlay Network for Efficient Entanglement Distribution
论文作者
论文摘要
长距离分发量子纠缠对于实现全球尺度量子互联网至关重要。大多数先前的工作和提案都假设纠缠的按需分布可能导致大量的网络资源利用不足。在这项工作中,我们引入了量子覆盖网络(QON),以在量子网络中有效纠缠分布。当创建端到端用户纠缠的需求较低时,QON可以在网络的特定覆盖存储节点上生成和存储最大纠缠的铃铛对(EPR对)。稍后,在高峰需求期间,可以通过通过网络的直接路径或使用存储节点在路径上执行纠缠掉期来提供请求。我们使用集中式优化框架在这种QON中解决了链接纠缠和存储资源分配问题。我们使用广泛的仿真实验评估了在各种设置下,在各种环境下进行广泛的网络拓扑的性能。我们的结果表明,与传统的非垒提案相比,QON在满足激增和需求变化方面的表现均高出40%。 QON在平均纠缠请求服务延迟对非盖帽的方法方面还显示出显着改善。
Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.