On the Analysis of a Multipartite Entanglement Distribution Switch
Authors:
Open Access
- 8 June 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 49-50
Abstract
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.Keywords
Funding Information
- National Science Foundation (ECCS-1640959, CNS-1617437)
This publication has 15 references indexed in Scilit:
- Optimal and secure measurement protocols for quantum sensor networksPhysical Review A, 2018
- Rate-distance tradeoff and resource costs for all-optical quantum repeatersPhysical Review A, 2017
- Optimal architectures for long distance quantum communicationScientific Reports, 2016
- Rate-loss analysis of an efficient quantum repeater architecturePhysical Review A, 2015
- -Efficient Bell Measurement with Passive Linear Optics and Unentangled AncillaePhysical Review Letters, 2014
- Controlled dense coding using the Greenberger-Horne-Zeilinger statePhysical Review A, 2001
- Quantum secret sharingPhysical Review A, 1999
- Quantum cryptography without Bell’s theoremPhysical Review Letters, 1992
- Quantum cryptography based on Bell’s theoremPhysical Review Letters, 1991
- Assembly-like queuesJournal of Applied Probability, 1973