Optimal Scheduling in a Quantum Switch

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bhambay, Sanidhay, Vasantam, Thirupathaiah, Walton, Neil
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912182157967360
author Bhambay, Sanidhay
Vasantam, Thirupathaiah
Walton, Neil
author_facet Bhambay, Sanidhay
Vasantam, Thirupathaiah
Walton, Neil
contents With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two sided queueing network. The switch generates Link Level Entanglements (LLEs), which are then fused to process the networks entanglement requests. Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.
format Preprint
id arxiv_https___arxiv_org_abs_2501_05380
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Optimal Scheduling in a Quantum Switch
Bhambay, Sanidhay
Vasantam, Thirupathaiah
Walton, Neil
Quantum Physics
Networking and Internet Architecture
Performance
Probability
With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two sided queueing network. The switch generates Link Level Entanglements (LLEs), which are then fused to process the networks entanglement requests. Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.
title Optimal Scheduling in a Quantum Switch
topic Quantum Physics
Networking and Internet Architecture
Performance
Probability
url https://arxiv.org/abs/2501.05380