A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
| Autor: | Fittipaldi, Paolo, Giovanidis, Anastasios, Grosshans, Frédéric |
|---|---|
| Přispěvatelé: | Information Quantique [LIP6] (QI), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Networks and Performance Analysis (NPA), ANR-21-CMAQ-0001,FQPS (PC),Soutien à la formation aux technologies quantiques - Paris Centre(2021), European Project: 820445,QIA |
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Quantum Physics Teleportation Scheduling Queueing analysis FOS: Physical sciences Integer programming Optimal scheduling Scheduling algorithms Quantum networks Computer Science - Networking and Internet Architecture Quantum entanglement [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph] Dynamic Scheduling Quantum Communication Quantum Physics (quant-ph) Lyapunov methods |
| Popis: | Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network - often called first generation quantum network - in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. The framework is then employed to mathematically derive a natural class of quadratic scheduling policies for quantum networks by applying Lyapunov Drift Minimization, a standard technique in classical network science. Moreover, an additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the computation cost, at the price of a slight performance degradation. The policies are compared in terms of information availability, localization and overall network performance through an ad-hoc simulator that admits user-provided network topologies and scheduling policies in order to showcase the potential application of the provided tools to quantum network design. Comment: 18 pages, 7 figures. To be submitted to the journal "IEEE Transactions on Quantum Engineering" |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|