期刊
QUEUEING SYSTEMS
卷 101, 期 3-4, 页码 291-328出版社
SPRINGER
DOI: 10.1007/s11134-021-09731-w
关键词
Quantum switch; Markov process; Queueing; Boundary value problem
资金
- National Science Foundation ERC Center for Quantum Networks (CQN) [EEC-1941583]
- National Science Foundation (NSF) [CNS-1955834, ERC-1941583]
- NWO ZK QSC Ada Lovelace Fellowship
This paper studies a quantum switch that distributes tripartite entangled states to sets of users. The technical aspects of this work contribute to queueing theory, and the problem formulation is of interest for distributed quantum applications.
We study a quantum switch that distributes tripartite entangled states to sets of users. The entanglement switching process requires two steps: First, each user attempts to generate bipartite entanglement between itself and the switch, and second, the switch performs local operations and a measurement to create multipartite entanglement for a set of three users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical. This problem formulation is of interest to several distributed quantum applications, while the technical aspects of this work result in new contributions within queueing theory. The state of the system is modeled as continuous-time Markov chain (CTMC), and performance metrics of interest (probability of an empty system, switch capacity, expectation, and variance of the number of qubit-pairs stored) are computed via the solution of a two-dimensional functional equation obtained by reducing it to a boundary value problem on a closed curve. This work is a follow-up of Nain et al. (Proc ACM Measure Anal Comput Syst(POMACS) 4, 2020) where a switch distributing entangled multipartite states to sets of users was studied, but only the switch capacity and the expected number of stored qubits were derived.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据