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. 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.