Quantum Switch Scheduling for Information Qubits

This paper studies the problem of designing a scheduling policy for a quantum switch that teleports information qubits. The problem is analogous to scheduling photons in highspeed optical switches, with the difference that an optical switch is modeled as a bipartite graph instead of a complete graph...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation review 2023-10, Vol.51 (2), p.78-80
Main Authors: Promponas, Panagiotis, Valls, V´ctor, Tassiulas, Leandros
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the problem of designing a scheduling policy for a quantum switch that teleports information qubits. The problem is analogous to scheduling photons in highspeed optical switches, with the difference that an optical switch is modeled as a bipartite graph instead of a complete graph. The paper's contributions are to model the problem of designing a scheduling policy as decomposing a symmetric doubly stochastic matrix, and to show that we can use Birkhoff's algorithm to obtain such a decomposition.
ISSN:0163-5999
1557-9484
DOI:10.1145/3626570.3626598