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:2405.09464 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Scalable Scheduling Policies for Quantum Satellite Networks

Albert Williams, Nitish K. Panigrahy, Andrew McGregor, Don Towsley

Published Sep 15, 2024• 8 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/qce60285.2024.00205

Related papers

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

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 Problem in Satellite-Based Quantum Networks

Xinliang Wei, Jiyao Liu, Lei Fan +3 more

Satellite-based quantum networks are emerging as a promising solution for the development of a global quantum internet in the near future. The ability to leverage the advantageous lower attenuation of optical signals from satellites to ground presents an exciting opportunity to establish a robust and secure quantum communication infrastructure on a global scale. By utilizing a constellation of satellites, it becomes feasible to continuously distribute high-fidelity quantum entanglements among ground stations over long distances, overcoming the limitations of traditional terrestrial-based quantum communication systems. In this article, we first provide a brief survey of existing solutions for satellite-based entanglement distribution, highlighting the various approaches and technologies that have been employed in this rapidly evolving field. We then delve into a formulated optimal entanglement distribution problem, aiming to optimize the distribution of quantum entanglement resources across the satellite network to maximize efficiency and reliability. This problem is addressed through a detailed exploration of several different methodologies and algorithms, each tailored to specific operational settings and constraints. Our experimental results confirm the efficiency of these approaches and provide valuable insights into their practical implementation and performance. Finally, we identify several key directions for further study and development in the realm of satellite-based quantum networks.

IEEE Network•May 8, 2024•21 citations

Opportunistic Scheduling for Single-downlink Satellite-based Quantum Key Distribution

Md Zakir Hossain, Nitish K. Panigrahy, Walter O. Krawec +2 more

Satellite-based quantum key distribution (QKD), leveraging low photon loss in free-space quantum communication, is widely regarded as one of the most promising directions to achieve global-scale QKD. With a constellation of satellites and a set of ground stations in a satellite-based QKD system, how to schedule satellites to achieve efficient QKD is an important problem. This problem has been studied in the dual-downlink architecture, where each satellite distributes pairs of entanglements to two ground stations simultaneously. However, it has not been studied in the single downlink architecture, where satellites create keys with each individual ground station, and then serve as trusted nodes to create keys between pairs of ground stations. While the single downlink architecture provides weaker security in that the satellites need to be trusted, it has many advantages, including the potential of achieving significantly higher key rates, and generating keys between pairs of ground stations that are far away from each other and cannot be served using the dual-downlink architecture. In this paper, we propose a novel opportunistic approach for satellite scheduling that accounts for fairness among the ground station pairs, while taking advantage of the dynamic satellite channels to maximize the system performance. We evaluate this approach in a wide range of settings and demonstrate that it provides the best tradeoffs in terms of total and minimum key rates across the ground station pairs. Our evaluation also highlights the importance of considering seasonal effects and cloud coverage in evaluating satellite-based QKD systems. In addition, we show different tradeoffs in global and regional QKD systems.

quant-pharXiv:2512.12514•Dec 16, 2025•1 citation

Dynamic Constellation Optimization for Quantum Key Distribution in LEO Satellite Networks

Thanh Phung Truong, Tung Son Do, Seongjin Choi +3 more

The deployment of quantum key distribution through low-Earth-orbit satellite constellations presents opportunities for global quantum-secure communications, but also raises nontrivial scheduling and reconfiguration problems across dynamic orbital and atmospheric conditions. This paper presents a multi-timescale optimization framework for QKD-enabled satellite networks that combines fast quantum-aware assignment, medium-horizon look-ahead, and slow constellation reconfiguration. We implement the proposed algorithm stack in a common simulation model with circular inclined LEO propagation, weather-dependent optical attenuation, and an asymptotic securekey-rate estimate derived from QBER. In a 120-satellite, 10ground-station study, the proposed multi-timescale optimization method achieves 26.87 kbps mean aggregate key rate, outperforming greedy scheduling (26.06 kbps) and one-step predictive Hungarian scheduling (25.97 kbps), while also reducing daily handovers to 2127. Across clear, variable, cloudy, and heavycloud conditions, the proposed method remains the highest-rate strategy in the evaluated set. These results provide a reproducible baseline for studying constellation-level QKD scheduling under executable assumptions.

International Conference on Ubiquitous and Future Networks•Jul 1, 2026•0 citations

Entanglement Distribution in LEO Satellite-based Dynamic Quantum Networks

Alena Chang, Yinxin Wan, Xuanli Lin +2 more

Recent advances in space quantum communications envision Low Earth Orbit (LEO) satellites for global entanglement distribution. Entanglement distribution in such a network requires considerations such as satellite mobility, ground station mobility due to the Earth’s rotation, inter-satellite links, and multiple orbital shells, all of which have not been thoroughly studied in the networking literature. We ameliorate this deficit by defining a system model which accounts for all of the aforementioned factors. Using this system model, we formulate the dynamic optimal entanglement distribution (DOED) problem. We convert the DOED problem in a dynamic physical network to an instance of the problem in a static logical graph, the latter of which can be used to solve the former. We obtain a reduced logical graph from a logical graph, which can be used to reduce the complexity of solving the DOED problem. We propose two polynomial-time greedy algorithms for computing entanglement paths, as well as an integer linear programming (ILP)-based algorithm as a benchmark. We present evaluation results to demonstrate the advantages of our model and algorithms.

Globecom•Dec 8, 2024•0 citations
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.
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 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.
Satellite-based quantum networks are emerging as a promising solution for the development of a global quantum internet in the near future. The ability to leverage the advantageous lower attenuation of optical signals from satellites to ground presents an exciting opportunity to establish a robust and secure quantum communication infrastructure on a global scale. By utilizing a constellation of satellites, it becomes feasible to continuously distribute high-fidelity quantum entanglements among ground stations over long distances, overcoming the limitations of traditional terrestrial-based quantum communication systems. In this article, we first provide a brief survey of existing solutions for satellite-based entanglement distribution, highlighting the various approaches and technologies that have been employed in this rapidly evolving field. We then delve into a formulated optimal entanglement distribution problem, aiming to optimize the distribution of quantum entanglement resources across the satellite network to maximize efficiency and reliability. This problem is addressed through a detailed exploration of several different methodologies and algorithms, each tailored to specific operational settings and constraints. Our experimental results confirm the efficiency of these approaches and provide valuable insights into their practical implementation and performance. Finally, we identify several key directions for further study and development in the realm of satellite-based quantum networks.
Satellite-based quantum key distribution (QKD), leveraging low photon loss in free-space quantum communication, is widely regarded as one of the most promising directions to achieve global-scale QKD. With a constellation of satellites and a set of ground stations in a satellite-based QKD system, how to schedule satellites to achieve efficient QKD is an important problem. This problem has been studied in the dual-downlink architecture, where each satellite distributes pairs of entanglements to two ground stations simultaneously. However, it has not been studied in the single downlink architecture, where satellites create keys with each individual ground station, and then serve as trusted nodes to create keys between pairs of ground stations. While the single downlink architecture provides weaker security in that the satellites need to be trusted, it has many advantages, including the potential of achieving significantly higher key rates, and generating keys between pairs of ground stations that are far away from each other and cannot be served using the dual-downlink architecture. In this paper, we propose a novel opportunistic approach for satellite scheduling that accounts for fairness among the ground station pairs, while taking advantage of the dynamic satellite channels to maximize the system performance. We evaluate this approach in a wide range of settings and demonstrate that it provides the best tradeoffs in terms of total and minimum key rates across the ground station pairs. Our evaluation also highlights the importance of considering seasonal effects and cloud coverage in evaluating satellite-based QKD systems. In addition, we show different tradeoffs in global and regional QKD systems.
The deployment of quantum key distribution through low-Earth-orbit satellite constellations presents opportunities for global quantum-secure communications, but also raises nontrivial scheduling and reconfiguration problems across dynamic orbital and atmospheric conditions. This paper presents a multi-timescale optimization framework for QKD-enabled satellite networks that combines fast quantum-aware assignment, medium-horizon look-ahead, and slow constellation reconfiguration. We implement the proposed algorithm stack in a common simulation model with circular inclined LEO propagation, weather-dependent optical attenuation, and an asymptotic securekey-rate estimate derived from QBER. In a 120-satellite, 10ground-station study, the proposed multi-timescale optimization method achieves 26.87 kbps mean aggregate key rate, outperforming greedy scheduling (26.06 kbps) and one-step predictive Hungarian scheduling (25.97 kbps), while also reducing daily handovers to 2127. Across clear, variable, cloudy, and heavycloud conditions, the proposed method remains the highest-rate strategy in the evaluated set. These results provide a reproducible baseline for studying constellation-level QKD scheduling under executable assumptions.
Recent advances in space quantum communications envision Low Earth Orbit (LEO) satellites for global entanglement distribution. Entanglement distribution in such a network requires considerations such as satellite mobility, ground station mobility due to the Earth’s rotation, inter-satellite links, and multiple orbital shells, all of which have not been thoroughly studied in the networking literature. We ameliorate this deficit by defining a system model which accounts for all of the aforementioned factors. Using this system model, we formulate the dynamic optimal entanglement distribution (DOED) problem. We convert the DOED problem in a dynamic physical network to an instance of the problem in a static logical graph, the latter of which can be used to solve the former. We obtain a reduced logical graph from a logical graph, which can be used to reduce the complexity of solving the DOED problem. We propose two polynomial-time greedy algorithms for computing entanglement paths, as well as an integer linear programming (ILP)-based algorithm as a benchmark. We present evaluation results to demonstrate the advantages of our model and algorithms.