Quantum entanglement distribution between remote nodes is key to many promising quantum applications. Existing mechanisms have mainly focused on improving throughput and fidelity via entanglement routing or single-node scheduling. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Two practical scenarios are considered. When requests do not have deadlines, we seek to minimize the average completion time of the communication requests. If deadlines are specified, we seek to maximize the number of requests whose deadlines are met. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI, and develop a probabilistic protocol to implement the optimized solutions in a general buffered quantum network. We develop a discrete-time quantum network simulator for evaluation. Results show the superior performance of ESDI compared to existing solutions.
翻译:在许多有前途的量子应用中,远程节点之间的量子纠缠分发是关键。现有机制主要集中于通过纠缠路由或单节点调度来提高吞吐量和保真度。本文考虑在整个量子网络拓扑中,对许多具有不同请求的源-目的地对进行量子纠缠调度和分发。考虑两个实际场景。当请求没有截止时间时,我们旨在尽量减少通信请求的平均完成时间。如果指定了截止日期,我们旨在最大化满足截止日期要求的请求数量。受传统单队列场景中最优调度学科的启发,我们设计了一个量子纠缠调度和分发的通用优化框架称为“ESDI”,并开发了一种概率协议来在一般缓冲量子网络中实现优化解决方案。我们开发了一个离散时间量子网络模拟器进行评估。结果表明,与现有解决方案相比, ESDI 的性能优越。