A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
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 article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10352642/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832586869110472704 |
|---|---|
| author | Paolo Fittipaldi Anastasios Giovanidis Frederic Grosshans |
| author_facet | Paolo Fittipaldi Anastasios Giovanidis Frederic Grosshans |
| author_sort | Paolo Fittipaldi |
| collection | DOAJ |
| description | 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 article 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 apply Lyapunov drift minimization (a standard technique in classical network science) to mathematically derive a natural class of scheduling policies for quantum networks minimizing the square norm of the user demand backlog. 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. |
| format | Article |
| id | doaj-art-7c6b450558594aa6beab50347d0878b4 |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-7c6b450558594aa6beab50347d0878b42025-01-25T00:03:26ZengIEEEIEEE Transactions on Quantum Engineering2689-18082024-01-01511810.1109/TQE.2023.334115110352642A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum NetworksPaolo Fittipaldi0https://orcid.org/0009-0007-6393-1979Anastasios Giovanidis1https://orcid.org/0000-0002-7121-4802Frederic Grosshans2https://orcid.org/0000-0001-8170-9668Sorbonne Université, CNRS, LIP6, Paris, FranceSorbonne Université, CNRS, LIP6, Paris, FranceSorbonne Université, CNRS, LIP6, Paris, FranceQuantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article 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 apply Lyapunov drift minimization (a standard technique in classical network science) to mathematically derive a natural class of scheduling policies for quantum networks minimizing the square norm of the user demand backlog. 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.https://ieeexplore.ieee.org/document/10352642/Dynamic schedulinginteger programmingLyapunov methodsquantum communicationquantum entanglementquantum networks |
| spellingShingle | Paolo Fittipaldi Anastasios Giovanidis Frederic Grosshans A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks IEEE Transactions on Quantum Engineering Dynamic scheduling integer programming Lyapunov methods quantum communication quantum entanglement quantum networks |
| title | A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks |
| title_full | A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks |
| title_fullStr | A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks |
| title_full_unstemmed | A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks |
| title_short | A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks |
| title_sort | linear algebraic framework for dynamic scheduling over memory equipped quantum networks |
| topic | Dynamic scheduling integer programming Lyapunov methods quantum communication quantum entanglement quantum networks |
| url | https://ieeexplore.ieee.org/document/10352642/ |
| work_keys_str_mv | AT paolofittipaldi alinearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks AT anastasiosgiovanidis alinearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks AT fredericgrosshans alinearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks AT paolofittipaldi linearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks AT anastasiosgiovanidis linearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks AT fredericgrosshans linearalgebraicframeworkfordynamicschedulingovermemoryequippedquantumnetworks |