论文标题
量子开关的吞吐量最佳调度策略
A Throughput Optimal Scheduling Policy for a Quantum Switch
论文作者
论文摘要
我们研究了一个量子开关，该量子开关可为连接到它的多组用户创建共享的端到端纠缠量子状态。每个用户都通过光学链接连接到交换机，在每个时间段中都会在每个时间段中生成双方铃铛纠缠状态，并具有某些概率，并且交换机合并链接的纠缠链接以为用户创建端到端的纠缠。链接的纠缠的一个固定位置存储在交换机上，纠缠的另一个量子存储在与链接相对应的用户中。假设一个时间段之后的链接纠缠量的数码符号，我们表征了容量区域，该区域被定义为端到端纠缠请求的一组到达速率集，该端到端纠缠的请求率是为了稳定交换机的调度策略。我们提出了最大重量调度策略，并表明它可以稳定在容量区域的所有到达率的转换。我们还提供数值结果来支持我们的分析。
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.
