TY - GEN
T1 - On the Analysis of a Multipartite Entanglement Distribution Switch
AU - Nain, Philippe
AU - Vardoyan, Gayane
AU - Guha, Saikat
AU - Towsley, Don
N1 - Publisher Copyright:
© 2019 Owner/Author.
PY - 2020/6/8
Y1 - 2020/6/8
N2 - We study a quantum switch that distributes maximally entangled multipartite 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 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. Further, we assume that all quantum states, if generated successfully, have perfect fidelity and that decoherence is negligible. 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. Via extensive use of Lyapunov functions, we derive necessary and sufficient conditions for the stability of the system and closed-form expressions for the switch capacity and the expected number of qubits in memory.
AB - We study a quantum switch that distributes maximally entangled multipartite 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 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. Further, we assume that all quantum states, if generated successfully, have perfect fidelity and that decoherence is negligible. 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. Via extensive use of Lyapunov functions, we derive necessary and sufficient conditions for the stability of the system and closed-form expressions for the switch capacity and the expected number of qubits in memory.
KW - entanglement distribution
KW - markov chain
KW - quantum switch
UR - http://www.scopus.com/inward/record.url?scp=85086994655&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086994655&partnerID=8YFLogxK
U2 - 10.1145/3393691.3394203
DO - 10.1145/3393691.3394203
M3 - Conference contribution
AN - SCOPUS:85086994655
T3 - SIGMETRICS Performance 2020 - Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
SP - 49
EP - 50
BT - SIGMETRICS Performance 2020 - Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
PB - Association for Computing Machinery, Inc
T2 - 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2020
Y2 - 8 June 2020 through 12 June 2020
ER -