A Linear Algebraic Framework for Quantum Internet Dynamic Scheduling

TL;DR

This paper introduces a linear algebraic framework for dynamic scheduling in quantum internet networks, enabling optimized routing and resource management with different information levels.

Contribution

It presents a novel algebraic model for quantum network scheduling that accounts for losses and supports both centralized and distributed decision-making.

Findings

Max-Weight inspired policies improve achievable rate regions

The algebraic model accommodates network losses and topology

Scheduling strategies vary with information availability

Abstract

Future quantum internet aims to enable quantum communication between arbitrary pairs of distant nodes through the sharing of end-to-end entanglement, a universal resource for many quantum applications. As in classical networks, quantum networks also have to resolve problems related to routing and satisfaction of service at a sufficient rate. We deal here with the problem of scheduling when multiple commodities must be served through a quantum network based on first generation quantum repeaters, or quantum switches. To this end, we introduce a novel discrete-time algebraic model for arbitrary network topology, including transmission and memory losses, and adapted to dynamic scheduling decisions. Our algebraic model allows the scheduler to use the storage of temporary intermediate links to optimize the performance, depending on the information availability, ranging from full global information for a centralized scheduler to partial local information for a distributed one. As an illustrative example, we compare a simple greedy scheduling policy with several Max-Weight inspired scheduling policies and illustrate the resulting achievable rate regions for two competing pairs of clients through a network.