Optimal Scheduling in a Quantum Switch

January 09, 2025 Β· Declared Dead Β· πŸ› Measurement and Modeling of Computer Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sanidhay Bhambay, Thirupathaiah Vasantam, Neil Walton arXiv ID 2501.05380 Category quant-ph: Quantum Computing Cross-listed cs.NI, cs.PF, math.PR Citations 3 Venue Measurement and Modeling of Computer Systems Last Checked 5 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted