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

International Conference on Communications

Quantum Adaptive Learning for Coverage Optimization in LEO Satellite Network

Silvirianti Silvirianti, Georges Kaddoum

Published Jun 8, 2025• 3 citations
Publisher

Abstract

A broader coverage of low earth orbit (LEO) satellite networks has been an object of research interest in recent years and will remain to be of keen interest to both start-ups and established companies in the future. However, achieving optimal coverage remains a challenge today, as the satellites dynamically move along their orbit, requiring frequent constellation size and beamsteering adjustments. Such frequent adjustments and the number of variables that need to be optimized result in a high computational complexity. Aiming to attend to these concerns, the present study proposes a quantum adaptive learning (QAL) as a potential solution for coverage optimization of stochastic geometry-based LEO satellite networks with low computational complexity by taking advantage of quantum computing and adaptive learning. The QAL scheme utilizes quantum computing and a feedback mechanism to improve the learning network design and parameters for higher accuracy with low computational complexity. As a study case, considering the binomial point process (BPP) distribution of contact distance between satellites and user terminals, we use the QAL scheme to optimize the satellites' constellation size and their corresponding beamsteering at each time step to achieve maximum coverage probability. To evaluate performance, the simulation results of the QAL scheme are compared with those of quantum machine learning (QML), which lacks feedback and adaptive mechanisms. The results show that the proposed QAL outperforms QML by achieving higher coverage probability, higher accuracy, and faster convergence.

DOI
10.1109/icc52391.2025.11161401

Related papers

Quantum Optimization Algorithm for LEO Satellite Communications based on Cell-Free Massive MIMO

Hayder Al-Hraishawi, Junaid ur Rehman, Symeon Chatzinotas

Low Earth orbit (LEO) satellite constellations are in the spotlight during this pivotal time of developing high-speed communications not only for provisioning non-terrestrial connectivity but also for establishing in-space backhauling solutions. However, the technological evolution in this direction faces many challenges especially in the framework of coexisting with other communication systems due to the spectrum scarcity and the aggregated interference. Recently, the concept of cell-free massive multiple-input multiple-output (MIMO) has been applied to the LEO constellations for ameliorating both energy and spectral efficiencies as well as improving interference mitigation. In this paper, we propose a quantum-based activation strategy for LEO satellites based on user demands using the cell-free massive MIMO communication scheme. Specifically, a binary integer linear optimization problem is formulated and solved using the quantum approximate optimization algorithm (QAOA), which provides tangible quantum advantages through swiftly finding the optimal solutions. The performance of the proposed technique is evaluated via simulations and compared to an adaptive power control scheme. It has been shown that approximately 45%, in average, of the LEO satellite nodes can be switched-off during various traffic load instances. Deactivating the redundant nodes would not only enhance the system energy efficiency but also reduce the computational workload at the constellation and minimize the inter-satellite interference.

IEEE International Conference on Communications workshops•May 28, 2023•17 citations

Quantum Reinforcement Learning With Classical Policy Deployment for Resource Allocation in Multibeam GEO–LEO Satellite Networks

Quynh Tu Ngo, Ying He, Beeshanga Abewardana Jayawickrama +2 more

Satellite communications (SatCom) are envisioned as a critical enabler of 6G networks, enabling seamless global coverage by integrating terrestrial infrastructures with multi-layered satellite constellations. Among these, the integration between geostationary (GEO) and low Earth orbit (LEO) satellite networks is particularly attractive, as they combine the broad coverage of GEO satellites with the low latency and high capacity of LEO systems. Within this context, we address the resource allocation problem for LEO satellite through a joint design of beam size and transmit power, while accounting for GEO interference constraints, residual Doppler frequency offsets, and frequency reuse strategies. The objective is to maximize the spectral efficiency of LEO system operating in multi-beam GEO-LEO networks. Motivated by the limitations of classical deep reinforcement learning (RL) in such dynamic orbital settings and the potential of quantum RL for accelerated convergence, we propose a hybrid solution that exploits quantum acceleration during offline training and subsequently exports the learned policy into a classical representational format for onboard LEO satellite deployment. A fully quantum deep deterministic policy gradient framework with variational quantum circuit-based actor and critic is developed, along with a neural network-based policy translator for classical inference. To the best of our knowledge, this is the first deployment-ready quantum RL framework in SatCom, offering efficient offline training, reduced retraining latency, and practical deployment compatibility with existing LEO satellite hardware.

IEEE Internet of Things Journal•Feb 10, 2026•1 citation

Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design

Divya Sisodiya, Amiratabak Bahengam, Hang Woon Lee +1 more

An increase in earth observation missions has increased the demand of efficient design and optimization of satellite constellations. Maximizing coverage of the target while effectively utilizing the limited orbital resources is one of the critical design challenges for complex combinatorial optimization problems. The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances. Using heuristics, metaheuristics, and mixed-integer linear programming, classical solvers have achieved optimal or near-optimal results, yet their scalability is limited as the problem size increases. Quantum computing advancements, including the quantum approximate optimization algorithms, offer a potential solution to NP-hard combinatorial optimization problems. Current quantum hardware limitations, such as low qubit counts and circuit depth, restrict solutions for small-scale instance problems. To address this challenge, this paper proposes a scalable quantum optimization framework for MCLP in satellite constellation design. A decomposition-based quantum methodology is proposed, in which large MCLP instances are partitioned into subgraphs by classical decomposition, optimized independently via quantum optimization circuits, and combined using quantum reconstruction strategies. Computational results across different constellation sizes reveal better scalability in less time while maintaining competitive coverage performance compared to classical solvers.

quant-pharXiv:2607.08102•IEEE Access•Jul 10, 2026•0 citations

Adaptive Entanglement-Aware Routing for Satellite Quantum Networks under Orbital and Atmospheric Variability

Dhrumil Bhatt, Vidushi Kumar

The expansion of satellite-based quantum networks requires adaptive routing mechanisms that can sustain entanglement under dynamic orbital and atmospheric conditions. Conventional schemes, often tailored to static or idealised topologies, fail to capture the combined effects of orbital motion, fading, and trust variability in inter-satellite links. This work proposes an \textit{adaptive entanglement-aware routing framework} that jointly accounts for orbital geometry, atmospheric attenuation, and multi-parameter link evaluation. The routing metric integrates fidelity, trust, and key-rate weights to maintain connectivity and mitigate loss from turbulence and fading. Monte Carlo simulations across multiple orbital densities ($ρ= 10^{-6}$~km$^{-3}$) and environmental regimes, standard atmosphere, strong turbulence, and clear-sky LEO show up to a 275\% improvement in key generation rate and a 15\% increase in effective entanglement fidelity over existing adaptive methods. The framework achieves sub-linear path-length scaling with network size and remains robust for fading variances up to $σ_{\mathrm{fade}}=0.1$, demonstrating strong potential for future global quantum constellations.

quant-pharXiv:2511.05228•IEEE International Conference on Advanced Networks and Telecommunications Systems•Nov 10, 2025•1 citation

Q-FLAP: Quantum-Secured Federated Learning with Adaptive Protection for Jamming-Resilient LEO Satellite-IoT Networks

Iqra Batool, Zubair Md. Fadlullah, Mostafa M. Fouda +2 more

Low Earth orbit (LEO) satellite constellations face two converging threats, adaptive jamming that learns defensive behavior and quantum computers capable of breaking today’s cryptography. To address this, we propose Q-FLAP, a unified framework that integrates quantum-secured federated learning (FL) with deep reinforcement learning (DRL), to address both challenges. Q-FLAP models anti-jamming channel selection as a distributed Markov decision process, where satellites learn policies via Deep Q-Networks while federated averaging enables coordination without centralizing sensitive data. Federated updates are secured using BB84 quantum key distribution (QKD) and lattice-based post-quantum cryptography (PQC), ensuring resilience against classical eavesdropping and harvest-now-decrypt-later attacks. Analytical results establish a steady-state throughput benchmark under adversarial jamming. Simulations show that under intelligent jamming, Q-FLAP retains 78% of nominal capacity, achieving 2.52 Gbps raw throughput and a 77.9% transmission success rate. Security overhead is minimal, 2.16% for QKD and 0.094% for PQC, yielding effective secure throughputs of 2.46 Gbps and 2.52 Gbps. Compared with baseline methods, Q-FLAP improves throughput by 2.5 times over random allocation and 1.67 times over greedy channel selection.

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•0 citations

Greedy Optimization for Enhancing Quantum Key Distribution Performance in Satellite Networks

Asif Akhtab Ronggon, Tuhin Hossain

Quantum Key Distribution (QKD) is a fundamental technology to ensure secure communication between distant points on the Earth, leveraging the principles of quantum mechanics (QM) to provide an unconditionally secure method for distributing cryptographic keys. In this paper, we investigate the optimization of QKD systems in low Earth orbit (LEO) through a simulation-based approach, utilizing a Greedy Optimization Agent (GOA) that dynamically adjusts key system parameters in response to changing atmospheric and orbital conditions. The agent adjusts the beam pointing, transmission loss, and coherence factors to maximize the quantum key rate while accounting for signal degradation due to atmospheric turbulence and misalignment. The experimental results demonstrate that the optimization of the QKD system significantly outperforms the baseline system. The optimization system outperformed the baseline by 13.82 %, with an average reward of$95.80 \pm 72.63$compared to$84.07 \pm 70.31$. In the same way, there was a 13.22 % rise in the average key rate, with the optimized system reaching$98.37 \pm 71.80$, rather than the baseline's$86.95 \pm 69.52$. In addition, the modified system significantly improved alignment by lowering the beam pointing error from 0.0456 in the baseline to 0.0170. These findings confirm that real-time dynamic adjustment is an effective strategy for improving the performance of satellitebased quantum communication systems.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)•Jul 31, 2025•0 citations
A broader coverage of low earth orbit (LEO) satellite networks has been an object of research interest in recent years and will remain to be of keen interest to both start-ups and established companies in the future. However, achieving optimal coverage remains a challenge today, as the satellites dynamically move along their orbit, requiring frequent constellation size and beamsteering adjustments. Such frequent adjustments and the number of variables that need to be optimized result in a high computational complexity. Aiming to attend to these concerns, the present study proposes a quantum adaptive learning (QAL) as a potential solution for coverage optimization of stochastic geometry-based LEO satellite networks with low computational complexity by taking advantage of quantum computing and adaptive learning. The QAL scheme utilizes quantum computing and a feedback mechanism to improve the learning network design and parameters for higher accuracy with low computational complexity. As a study case, considering the binomial point process (BPP) distribution of contact distance between satellites and user terminals, we use the QAL scheme to optimize the satellites' constellation size and their corresponding beamsteering at each time step to achieve maximum coverage probability. To evaluate performance, the simulation results of the QAL scheme are compared with those of quantum machine learning (QML), which lacks feedback and adaptive mechanisms. The results show that the proposed QAL outperforms QML by achieving higher coverage probability, higher accuracy, and faster convergence.
Low Earth orbit (LEO) satellite constellations are in the spotlight during this pivotal time of developing high-speed communications not only for provisioning non-terrestrial connectivity but also for establishing in-space backhauling solutions. However, the technological evolution in this direction faces many challenges especially in the framework of coexisting with other communication systems due to the spectrum scarcity and the aggregated interference. Recently, the concept of cell-free massive multiple-input multiple-output (MIMO) has been applied to the LEO constellations for ameliorating both energy and spectral efficiencies as well as improving interference mitigation. In this paper, we propose a quantum-based activation strategy for LEO satellites based on user demands using the cell-free massive MIMO communication scheme. Specifically, a binary integer linear optimization problem is formulated and solved using the quantum approximate optimization algorithm (QAOA), which provides tangible quantum advantages through swiftly finding the optimal solutions. The performance of the proposed technique is evaluated via simulations and compared to an adaptive power control scheme. It has been shown that approximately 45%, in average, of the LEO satellite nodes can be switched-off during various traffic load instances. Deactivating the redundant nodes would not only enhance the system energy efficiency but also reduce the computational workload at the constellation and minimize the inter-satellite interference.
Satellite communications (SatCom) are envisioned as a critical enabler of 6G networks, enabling seamless global coverage by integrating terrestrial infrastructures with multi-layered satellite constellations. Among these, the integration between geostationary (GEO) and low Earth orbit (LEO) satellite networks is particularly attractive, as they combine the broad coverage of GEO satellites with the low latency and high capacity of LEO systems. Within this context, we address the resource allocation problem for LEO satellite through a joint design of beam size and transmit power, while accounting for GEO interference constraints, residual Doppler frequency offsets, and frequency reuse strategies. The objective is to maximize the spectral efficiency of LEO system operating in multi-beam GEO-LEO networks. Motivated by the limitations of classical deep reinforcement learning (RL) in such dynamic orbital settings and the potential of quantum RL for accelerated convergence, we propose a hybrid solution that exploits quantum acceleration during offline training and subsequently exports the learned policy into a classical representational format for onboard LEO satellite deployment. A fully quantum deep deterministic policy gradient framework with variational quantum circuit-based actor and critic is developed, along with a neural network-based policy translator for classical inference. To the best of our knowledge, this is the first deployment-ready quantum RL framework in SatCom, offering efficient offline training, reduced retraining latency, and practical deployment compatibility with existing LEO satellite hardware.
An increase in earth observation missions has increased the demand of efficient design and optimization of satellite constellations. Maximizing coverage of the target while effectively utilizing the limited orbital resources is one of the critical design challenges for complex combinatorial optimization problems. The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances. Using heuristics, metaheuristics, and mixed-integer linear programming, classical solvers have achieved optimal or near-optimal results, yet their scalability is limited as the problem size increases. Quantum computing advancements, including the quantum approximate optimization algorithms, offer a potential solution to NP-hard combinatorial optimization problems. Current quantum hardware limitations, such as low qubit counts and circuit depth, restrict solutions for small-scale instance problems. To address this challenge, this paper proposes a scalable quantum optimization framework for MCLP in satellite constellation design. A decomposition-based quantum methodology is proposed, in which large MCLP instances are partitioned into subgraphs by classical decomposition, optimized independently via quantum optimization circuits, and combined using quantum reconstruction strategies. Computational results across different constellation sizes reveal better scalability in less time while maintaining competitive coverage performance compared to classical solvers.
The expansion of satellite-based quantum networks requires adaptive routing mechanisms that can sustain entanglement under dynamic orbital and atmospheric conditions. Conventional schemes, often tailored to static or idealised topologies, fail to capture the combined effects of orbital motion, fading, and trust variability in inter-satellite links. This work proposes an \textit{adaptive entanglement-aware routing framework} that jointly accounts for orbital geometry, atmospheric attenuation, and multi-parameter link evaluation. The routing metric integrates fidelity, trust, and key-rate weights to maintain connectivity and mitigate loss from turbulence and fading. Monte Carlo simulations across multiple orbital densities (ρ=10−6ρ= 10^{-6}ρ=10−6~km−3^{-3}−3) and environmental regimes, standard atmosphere, strong turbulence, and clear-sky LEO show up to a 275\% improvement in key generation rate and a 15\% increase in effective entanglement fidelity over existing adaptive methods. The framework achieves sub-linear path-length scaling with network size and remains robust for fading variances up to σfade=0.1σ_{\mathrm{fade}}=0.1σfade​=0.1, demonstrating strong potential for future global quantum constellations.
Low Earth orbit (LEO) satellite constellations face two converging threats, adaptive jamming that learns defensive behavior and quantum computers capable of breaking today’s cryptography. To address this, we propose Q-FLAP, a unified framework that integrates quantum-secured federated learning (FL) with deep reinforcement learning (DRL), to address both challenges. Q-FLAP models anti-jamming channel selection as a distributed Markov decision process, where satellites learn policies via Deep Q-Networks while federated averaging enables coordination without centralizing sensitive data. Federated updates are secured using BB84 quantum key distribution (QKD) and lattice-based post-quantum cryptography (PQC), ensuring resilience against classical eavesdropping and harvest-now-decrypt-later attacks. Analytical results establish a steady-state throughput benchmark under adversarial jamming. Simulations show that under intelligent jamming, Q-FLAP retains 78% of nominal capacity, achieving 2.52 Gbps raw throughput and a 77.9% transmission success rate. Security overhead is minimal, 2.16% for QKD and 0.094% for PQC, yielding effective secure throughputs of 2.46 Gbps and 2.52 Gbps. Compared with baseline methods, Q-FLAP improves throughput by 2.5 times over random allocation and 1.67 times over greedy channel selection.
Quantum Key Distribution (QKD) is a fundamental technology to ensure secure communication between distant points on the Earth, leveraging the principles of quantum mechanics (QM) to provide an unconditionally secure method for distributing cryptographic keys. In this paper, we investigate the optimization of QKD systems in low Earth orbit (LEO) through a simulation-based approach, utilizing a Greedy Optimization Agent (GOA) that dynamically adjusts key system parameters in response to changing atmospheric and orbital conditions. The agent adjusts the beam pointing, transmission loss, and coherence factors to maximize the quantum key rate while accounting for signal degradation due to atmospheric turbulence and misalignment. The experimental results demonstrate that the optimization of the QKD system significantly outperforms the baseline system. The optimization system outperformed the baseline by 13.82 %, with an average reward of95.80±72.6395.80 \pm 72.6395.80±72.63compared to84.07±70.3184.07 \pm 70.3184.07±70.31. In the same way, there was a 13.22 % rise in the average key rate, with the optimized system reaching98.37±71.8098.37 \pm 71.8098.37±71.80, rather than the baseline's86.95±69.5286.95 \pm 69.5286.95±69.52. In addition, the modified system significantly improved alignment by lowering the beam pointing error from 0.0456 in the baseline to 0.0170. These findings confirm that real-time dynamic adjustment is an effective strategy for improving the performance of satellitebased quantum communication systems.