Quantum Adaptive Learning for Coverage Optimization in LEO Satellite Network
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.
Authors
- Georges Kaddoum (ORCID: https://orcid.org/0000-0002-5025-6624)
- Silvirianti Silvirianti
Institutions
- Xuzhou Construction Machinery Group (China) (CN)
Publication Details
- Published
- 2025-06-08
- DOI
- https://doi.org/10.1109/icc52391.2025.11161401
- Primary Topic
- Satellite Communication Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00