Age-Based Scheduling for a Memory-Constrained Quantum Switch

TL;DR

This paper introduces age-based scheduling policies for a quantum switch with limited memory, optimizing entanglement establishment times under probabilistic link conditions and decoherence.

Contribution

It proposes novel low-complexity scheduling policies with closed-form AoEE performance metrics for quantum switches, including optimization and performance guarantees.

Findings

Derived closed-form AoEE expressions for proposed policies

Optimized policies outperform baseline in simulations

Provided performance guarantees for new scheduling policy

Abstract

In a time-slotted system, we study the problem of scheduling multipartite entanglement requests in a quantum switch with a finite number of quantum memory registers. Specifically, we consider probabilistic link-level entanglement (LLE) generation for each user, probabilistic entanglement swapping, and one-slot decoherence. To evaluate the performance of the proposed scheduling policies, we introduce a novel age-based metric, coined age of entanglement establishment (AoEE). We consider two families of low-complexity policies for which we obtain closed-form expressions for their corresponding AoEE performance. Optimizing over each family, we obtain two policies. Further, we propose one more low-complexity policy and provide its performance guarantee. Finally, we numerically compare the performance of the proposed policies.