arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.03205quant-phcs.PF
收藏

一种量子交换机的吞吐量优化调度策略

A Throughput Optimal Scheduling Policy for a Quantum Switch

Thirupathaiah Vasantam, Don Towsley

摘要:

我们研究了一种量子交换机,该交换机通过光链路为多组用户创建共享的端到端纠缠量子态,每个用户通过光链路连接到交换机,在每个时隙中以一定的概率生成二分Bell态纠缠态,交换机合并链路的纠缠为用户创建端到端纠缠.链路的纠缠的一个量子比特存储在交换机处,并且纠缠的另一个量子比特存储在对应于链路的用户处。假设量子比特的纠缠的链接解密后,一个时隙,我们的能力区域,这是定义为一组的到达率的请求端到端的纠缠存在一个调度策略,稳定的开关。我们提出了一个最大权重调度策略,并表明它稳定的开关的所有到达率,位于容量区域。我们还提供了数值结果来支持我们的分析。

英文摘要:

We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.

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

↑