Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

A throughput optimal scheduling policy for a quantum switch

Vasantam, Thirupathaiah and Towsley, Don (2022) 'A throughput optimal scheduling policy for a quantum switch.', in Quantum Computing, Communication, and Simulation II. , p. 1201505. Proceedings of SPIE., 12015

Abstract

We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.

Item Type:Book chapter
Full text:(VoR) Version of Record
Download PDF
(511Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1117/12.2616950
Publisher statement:© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE)
Date accepted:No date available
Date deposited:25 May 2022
Date of first online publication:01 March 2022
Date first made open access:25 May 2022

Save or Share this output

Export:
Export
Look up in GoogleScholar