Presentation + Paper
1 March 2022 A throughput optimal scheduling policy for a quantum switch
Author Affiliations +
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.
Conference Presentation
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thirupathaiah Vasantam and Don Towsley "A throughput optimal scheduling policy for a quantum switch", Proc. SPIE 12015, Quantum Computing, Communication, and Simulation II, 1201505 (1 March 2022); https://doi.org/10.1117/12.2616950
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Switches

Quantum communications

Quantum networks

Quantum computing

Quantum information

Quantum memory

Entangled states

Back to Top