Analysis of a tripartite entanglement distribution switch

Philippe Nain (), Gayane Vardoyan (), Saikat Guha () and Don Towsley ()
Additional contact information
Philippe Nain: Centre Inria at Université Côte d’Azur
Gayane Vardoyan: Delft University of Technology
Saikat Guha: The University of Arizona
Don Towsley: University of Massachusetts

Queueing Systems: Theory and Applications, 2022, vol. 101, issue 3, No 4, 328 pages

Abstract: Abstract 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.

Keywords: Quantum switch; Markov process; Queueing; Boundary value problem; 60K25; 68M12; 68M20; 81-10; 90B22 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-021-09731-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:101:y:2022:i:3:d:10.1007_s11134-021-09731-w

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-021-09731-w

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().