Abstract We study an entanglement distribution switch that serves k users in a star topology. The function of the switch is to facilitate end-to-end bipartite entangled state generation for pairs of users. We study a simple variant of this problem, wherein all links connecting the users to the switch are identical, the effects of state decoherence are negligible, and the switch can store an arbitrary number of qubits. We model the system using a discrete-time Markov chain and obtain the capacity of the switch. When the switch operates at capacity, we also present a numerical method for computing the expected number of qubits stored at the switch, which depends on the number of users k and the probability of successful entanglement generation at the link level p . We then compare the results of our exact analysis to that of a continuous-time Markov chain model of a quantum switch and argue that the latter is a reasonable approximation to the more realistic model presented in this work.

中文翻译：

---

关于理想化量子开关的精确分析

摘要 我们研究了一种在星型拓扑中为 k 个用户提供服务的纠缠分配交换机。开关的作用是促进成对用户的端到端二分纠缠状态生成。我们研究了这个问题的一个简单变体，其中将用户连接到交换机的所有链接都是相同的，状态退相干的影响可以忽略不计，并且交换机可以存储任意数量的量子比特。我们使用离散时间马尔可夫链对系统进行建模并获得开关的容量。当交换机满负荷运行时，我们还提出了一种数值方法来计算存储在交换机上的预期量子比特数，这取决于用户数 k 和在链路级别 p 上成功产生纠缠的概率。