Age-Based Scheduling for a Memory-Constrained Quantum Switch
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911381987524608 |
|---|---|
| author | Mitrolaris, Stavros Banerjee, Subhankar Ulukus, Sennur |
| author_facet | Mitrolaris, Stavros Banerjee, Subhankar Ulukus, Sennur |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_11698 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Age-Based Scheduling for a Memory-Constrained Quantum Switch Mitrolaris, Stavros Banerjee, Subhankar Ulukus, Sennur Information Theory Networking and Internet Architecture Systems and Control 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. |
| title | Age-Based Scheduling for a Memory-Constrained Quantum Switch |
| topic | Information Theory Networking and Internet Architecture Systems and Control |
| url | https://arxiv.org/abs/2601.11698 |