Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.05854

Dynamic Scheduling in Fiber and Spaceborne Quantum Repeater Networks

Paolo Fittipaldi

Published Oct 7, 2025• 0 citations
arXivHTMLPDF

Abstract

The problem of scheduling in quantum networks amounts to choosing which entanglement swapping operations to perform to better serve user demand. The choice can be carried out following a variety of criteria (e.g. ensuring all users are served equally vs. prioritizing specific critical applications, adopting heuristic or optimization-based algorithms...), requiring a method to compare different solutions and choose the most appropriate. We present a framework to mathematically formulate the scheduling problem over quantum networks and benchmark general quantum scheduling policies over arbitrary lossy quantum networks. By leveraging the framework, we apply Lyapunov drift minimization to derive a novel class of quadratic optimization based scheduling policies, which we then analyze and compare with a Max Weight inspired linear class. We then give an overview of the pre-existing fiber quantum simulation tools and report on the development of numerous extensions to QuISP, an established quantum network simulator focused on scalability and accuracy in modeling the underlying classical network infrastructure. To integrate satellite links in the discussion, we derive an analytical model for the entanglement distribution rates for satellite-to-ground and ground-satellite-ground links and discuss different quantum memory allocation policies for the dual link case. Our findings show that classical communication latency is a major limiting factor for satellite communication, and the effects of physical upper bounds such as the speed of light must be taken into account when designing quantum links, limiting the attainable rates to tens of kHz. We conclude by summarizing our findings and highlighting the challenges that still need to be overcome in order to study the quantum scheduling problem over fiber and satellite quantum networks. [Abridged abstract, see PDF for full version]

DOI
10.48550/arxiv.2510.05854

Related papers

A Linear Algebraic Framework for Quantum Internet Dynamic Scheduling

Paolo Fittipaldi, Anastasios Giovanidis, Frédéric Grosshans

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.

arXiv:2205.10000•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•7 citations

Scheduling in Quantum Satellite Networks: Fairness and Performance Optimization

Ashutosh Jayant Dikshit, Naga Lakshmi Anipeddi, Prajit Dhara +5 more

Quantum satellite networks offer a promising solution for achieving long-distance quantum communication by enabling entanglement distribution across global scales. This work formulates and solves the quantum satellite network scheduling problem by optimizing satellite-to-ground station pair assignments under realistic system and environmental constraints. Our framework accounts for limited satellite and ground station resources, fairness, entanglement fidelity thresholds, and real world non-idealities including atmospheric losses, weather and background noise. In addition, we incorporate the complexities of multi-satellite relays enabled via inter-satellite links. We propose an integer linear programming (ILP) based optimization framework that supports multiple scheduling objectives, allowing us to analyze tradeoffs between maximizing total entanglement distribution rate and ensuring fairness across ground station pairs. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies.

quant-pharXiv:2512.07108•Dec 9, 2025•2 citations

Optimal Entanglement Distribution using Satellite Based Quantum Networks

Nitish K. Panigrahy, Prajit Dhara, Don Towsley +2 more

Recent technological advancements in satellite based quantum communication has made it a promising technology for realizing global scale quantum networks. Due to better loss distance scaling compared to ground based fiber communication, satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances. This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites. In particular, we characterize the optimal satellite-to-ground station transmission scheduling policy with respect to the aggregate entanglement distribution rate subject to various resource constraints at the satellites and ground stations. We cast the optimal transmission scheduling problem as an integer linear programming problem and solve it efficiently for some specific scenarios. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies.

arXiv:2205.12354•IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•May 2, 2022•28 citations

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Paolo Fittipaldi, Anastasios Giovanidis, Frédéric Grosshans

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 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.

arXiv:2307.06009•IEEE Transactions on Quantum Engineering•Dec 11, 2023•11 citations

Scalable Scheduling Policies for Quantum Satellite Networks

Albert Williams, Nitish K. Panigrahy, Andrew McGregor +1 more

As Low Earth Orbit (LEO) satellite mega constellations continue to be deployed for satellite internet and recent successful experiments in satellite-based quantum entanglement distribution emerge, a natural question arises: How should we coordinate transmissions and design scalable scheduling policies for a quantum satellite internet? In this work, we consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We then propose four heuristic algorithms and evaluate their performance for Starlink mega constellation under various amount of resources and placements of the ground stations. We find that the maximum number of receivers necessary per ground station grows very slowly with the total number of deployed ground stations. Our proposed algorithms, leveraging optimal weighted b-matching and the global greedy heuristic, outperform others in entanglement distribution rate, entanglement fidelity, and handover cost metrics. While we develop these scheduling algorithms, we have also designed a software system to simulate, visualize, and evaluate satellite mega-constellations for entanglement distribution.

arXiv:2405.09464•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•8 citations

Single-Satellite Quantum Repeater Performance Analysis

Cameron Paterson, Jasminder S. Sidhu, Thomas Brougham +2 more

Satellite optical links may be able to extend quantum communication range beyond that which is possible through optical fibres which are constrained by exponential loss scaling. Quantum repeaters have been proposed to mitigate high channel losses in both fibre and satellite links. Although satellite quantum repeaters could improve entanglement distribution efficiency, the attempt rate is constrained by classical communication latency in the entanglement swapping step. Direct entanglement distribution does not suffer this latency and can therefore compensate for high dual-downlink losses by increasing the source rate. A systematic comparative analysis of repeater-assisted and direct entanglement distribution rates using a satellite is absent from the literature. In addition to entanglement distribution rates, a detailed analysis of the fidelity of entanglement distributed by repeater-assisted satellite links has yet to be performed. Here, we develop an in-depth framework for describing a space quantum link consisting of a single satellite and two ground stations. We compare the entanglement distribution rates of direct and repeater-assisted satellite entanglement distribution, taking into account variations in overpass geometry and quantum memory capacity. The long-term entanglement distribution performance to different pairs of major cities is also considered, and the altitudinal dependence is explored. Furthermore, we develop a Monte Carlo model of the repeater satellite to explore the effect that different memory management policies and capacities have on the waiting time statistics of memory qubits. From these statistics we calculate the fidelity distributions of the entangled pairs established between the ground stations. These results will inform mission design for future space-borne quantum repeater nodes, as well as requirements on space-based memory platforms.

quant-pharXiv:2604.16165•Apr 20, 2026•0 citations
The problem of scheduling in quantum networks amounts to choosing which entanglement swapping operations to perform to better serve user demand. The choice can be carried out following a variety of criteria (e.g. ensuring all users are served equally vs. prioritizing specific critical applications, adopting heuristic or optimization-based algorithms...), requiring a method to compare different solutions and choose the most appropriate. We present a framework to mathematically formulate the scheduling problem over quantum networks and benchmark general quantum scheduling policies over arbitrary lossy quantum networks. By leveraging the framework, we apply Lyapunov drift minimization to derive a novel class of quadratic optimization based scheduling policies, which we then analyze and compare with a Max Weight inspired linear class. We then give an overview of the pre-existing fiber quantum simulation tools and report on the development of numerous extensions to QuISP, an established quantum network simulator focused on scalability and accuracy in modeling the underlying classical network infrastructure. To integrate satellite links in the discussion, we derive an analytical model for the entanglement distribution rates for satellite-to-ground and ground-satellite-ground links and discuss different quantum memory allocation policies for the dual link case. Our findings show that classical communication latency is a major limiting factor for satellite communication, and the effects of physical upper bounds such as the speed of light must be taken into account when designing quantum links, limiting the attainable rates to tens of kHz. We conclude by summarizing our findings and highlighting the challenges that still need to be overcome in order to study the quantum scheduling problem over fiber and satellite quantum networks. [Abridged abstract, see PDF for full version]
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.
Quantum satellite networks offer a promising solution for achieving long-distance quantum communication by enabling entanglement distribution across global scales. This work formulates and solves the quantum satellite network scheduling problem by optimizing satellite-to-ground station pair assignments under realistic system and environmental constraints. Our framework accounts for limited satellite and ground station resources, fairness, entanglement fidelity thresholds, and real world non-idealities including atmospheric losses, weather and background noise. In addition, we incorporate the complexities of multi-satellite relays enabled via inter-satellite links. We propose an integer linear programming (ILP) based optimization framework that supports multiple scheduling objectives, allowing us to analyze tradeoffs between maximizing total entanglement distribution rate and ensuring fairness across ground station pairs. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies.
Recent technological advancements in satellite based quantum communication has made it a promising technology for realizing global scale quantum networks. Due to better loss distance scaling compared to ground based fiber communication, satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances. This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites. In particular, we characterize the optimal satellite-to-ground station transmission scheduling policy with respect to the aggregate entanglement distribution rate subject to various resource constraints at the satellites and ground stations. We cast the optimal transmission scheduling problem as an integer linear programming problem and solve it efficiently for some specific scenarios. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies.
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 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.
As Low Earth Orbit (LEO) satellite mega constellations continue to be deployed for satellite internet and recent successful experiments in satellite-based quantum entanglement distribution emerge, a natural question arises: How should we coordinate transmissions and design scalable scheduling policies for a quantum satellite internet? In this work, we consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We then propose four heuristic algorithms and evaluate their performance for Starlink mega constellation under various amount of resources and placements of the ground stations. We find that the maximum number of receivers necessary per ground station grows very slowly with the total number of deployed ground stations. Our proposed algorithms, leveraging optimal weighted b-matching and the global greedy heuristic, outperform others in entanglement distribution rate, entanglement fidelity, and handover cost metrics. While we develop these scheduling algorithms, we have also designed a software system to simulate, visualize, and evaluate satellite mega-constellations for entanglement distribution.
Satellite optical links may be able to extend quantum communication range beyond that which is possible through optical fibres which are constrained by exponential loss scaling. Quantum repeaters have been proposed to mitigate high channel losses in both fibre and satellite links. Although satellite quantum repeaters could improve entanglement distribution efficiency, the attempt rate is constrained by classical communication latency in the entanglement swapping step. Direct entanglement distribution does not suffer this latency and can therefore compensate for high dual-downlink losses by increasing the source rate. A systematic comparative analysis of repeater-assisted and direct entanglement distribution rates using a satellite is absent from the literature. In addition to entanglement distribution rates, a detailed analysis of the fidelity of entanglement distributed by repeater-assisted satellite links has yet to be performed. Here, we develop an in-depth framework for describing a space quantum link consisting of a single satellite and two ground stations. We compare the entanglement distribution rates of direct and repeater-assisted satellite entanglement distribution, taking into account variations in overpass geometry and quantum memory capacity. The long-term entanglement distribution performance to different pairs of major cities is also considered, and the altitudinal dependence is explored. Furthermore, we develop a Monte Carlo model of the repeater satellite to explore the effect that different memory management policies and capacities have on the waiting time statistics of memory qubits. From these statistics we calculate the fidelity distributions of the entangled pairs established between the ground stations. These results will inform mission design for future space-borne quantum repeater nodes, as well as requirements on space-based memory platforms.