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.
翻译:我们研究一个量子开关,它能为连接它的多组用户创造共同端到端的缠绕量子状态。每个用户都通过光学连接连接到开关,在光学连接中,在每一个时间间隔中产生双边贝尔州缠绕状态,每个时间间隔中都有一定的概率,而开关的交点的交织交织为用户创建端到端的缠绕。在开关中储存了一个链接缠绕的方位,而另一个缠绕的方位则存储在与该链接对应的用户处。假设在一次间隔后断开链接缠绕的方位,我们将能力区域定性为终端到端缠绕线请求的到达率设定一套固定开关的政策。我们提议了一个最大值列表政策,并显示它稳定了能力区域内所有到达速度的开关。我们还提供了数字结果来支持我们的分析。