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

Quantum Annealing-Based Algorithm for Efficient Coalition Formation Among LEO Satellites

Supreeth Mysore Venkatesh, Antonio Macaluso, Marlon Nuske, Matthias Klusch, Andreas R. Dengel

Published Sep 15, 2024• 8 citations
arXivHTMLPDF

Abstract

The increasing number of Low Earth Orbit (LEO) satellites, driven by lower manufacturing and launch costs, is proving invaluable for Earth observation missions and low-latency internet connectivity. However, as the number of satellites increases, the number of communication links to maintain also rises, making the management of this vast network increasingly challenging and highlighting the need for clustering satellites into efficient groups as a promising solution. This paper formulates the clustering of LEO satellites as a coalition structure generation (CSG) problem and leverages quantum annealing to solve it. We represent the satellite network as a graph and obtain the optimal partitions using a hybrid quantum-classical algorithm called GCS-Q. The algorithm follows a top-down approach by iteratively splitting the graph at each step using a quadratic unconstrained binary optimization (QUBO) formulation. To evaluate our approach, we utilize real-world three-line element set (TLE/3LE) data for Starlink satellites from Celestrak. Our experiments, conducted using the D-Wave Advantage annealer and the state-of-the-art solver Gurobi, demonstrate that the quantum annealer significantly outperforms classical methods in terms of runtime while maintaining the solution quality. The performance achieved with quantum annealers surpasses the capabilities of classical computers, highlighting the transformative potential of quantum computing in optimizing the management of large-scale satellite networks.

DOI
10.1109/qce60285.2024.10279

Related papers

Low-earth Orbit Satellite Network Optimization and Statistical Qubit Freezing on Quantum Annealer

Jeung Rac Lee, Yunheon Lee, Dongsu Han +3 more

Recent studies have shown promising results indicating the potential of Noisy Intermediate Scale Quantum (NISQ) devices. In this work, Low-earth Orbit (LEO) satellite network design problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and Quantum Annealing (QA) is utilized to solve the resulting problem with real world setting. Compare to classical approaches, the experimental results indicate improvements in terms of network path length and number of satellite hops in network path that amount to network latency. Further, an iterative post-processing method, Statistical Qubit Freezing (SQF), which freezes initial states of qubits and reduces the size of the problem in each annealing cycle, is proposed and evaluated. Solution found with SQF indicates that SQF in fact allows the system to reach lower energy state.

International Conference on Communications•May 28, 2023•1 citation

Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem

Thinh Q. Dinh, Son Hoang Dau, Eva Lagunas +1 more

Beam Placement (BP) is a well-known problem in Low-Earth Orbit (LEO) satellite communication (SatCom) systems, which can be modelled as an NP-hard clique cover problem. Recently, quantum computing has emerged as a novel technology which revolutionizes how to solve challenging optimization problems by formulating Quadratic Unconstrained Binary Optimization (QUBO), then preparing Hamiltonians as inputs for quantum computers. In this paper, we study how to use quantum computing to solve BP problems. However, due to limited hardware resources, existing quantum computers are unable to tackle large optimization spaces. Therefore, we propose an efficient Hamiltonian Reduction method that allows quantum processors to solve large BP instances encountered in LEO systems. We conduct our simulations on real quantum computers (D-Wave Advantage) using a real dataset of vessel locations in the US. Numerical results show that our algorithm outperforms commercialized solutions of D-Wave by allowing existing quantum annealers to solve 17.5 times larger BP instances while maintaining high solution quality. Although quantum computing cannot theoretically overcome the hardness of BP problems, this work contributes early efforts to applying quantum computing in satellite optimization problems, especially applications formulated as clique cover/graph coloring problems.

arXiv:2210.06042•International Conference on Communications•May 28, 2023•12 citations

Evidence of quantum scaling advantage in approximate optimization for energy coalition formation with 100+ agents

Naeimeh Mohseni, Thomas Morstyn, Corey O’Meara +3 more

Abstract The formation of energy communities is pivotal for advancing decentralized and sustainable energy management. Within this context, coalition structure generation (CSG) emerges as a promising framework. The complexity of CSG grows rapidly with the number of agents, making classical solvers impractical for even moderate sizes. This suggests CSG as an ideal candidate for benchmarking quantum algorithms against classical ones. Facing ongoing challenges in attaining computational quantum advantage for exact optimization, we pivot our focus to benchmarking quantum and classical solvers for approximate optimization. Approximate optimization is particularly critical for industrial use cases requiring real-time optimization, where finding high-quality solutions quickly is often more valuable than achieving exact solutions more slowly. Our findings indicate that quantum annealing (QA) on DWave can achieve solutions of comparable quality to our best classical solver, but with more favorable runtime scaling, showcasing an advantage. This advantage is observed when compared to solvers, such as Tabu search, simulated annealing, and the state-of-the-art solver Gurobi in finding approximate solutions for energy community formation involving over 100 agents. DWave also surpasses 1-round QAOA on IBM hardware. Our findings represent the largest benchmark of quantum approximate optimizations for a real-world dense model beyond the hardware’s native topology, where D-Wave demonstrates a scaling advantage.

arXiv:2405.11917•Quantum Science and Technology•Nov 6, 2025•7 citations

Quantum Optimization for Closed-Loop Scheduling of Earth Observation Satellite Formation

Vinicius Marchioli, Mattia Boggio, Deborah Volpe +2 more

Abstract The scheduling complexity of Agile Earth Observation Satellites (AEOSs) increases significantly as Earth Observation missions progress. This makes traditional optimization techniques less effective, restricting their application to small-scale and open-loop scheduling problems. In this paper, we investigate the potential of quantum solvers to address the closed-loop scheduling problem for a formation of AEOSs, overcoming the limitations of classical optimization techniques. To this end, we formulate the scheduling problem as a novel Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e., a formulation specifically designed for quantum solvers. Moreover, penalty functions are introduced to minimize mission energy consumption and reduce deviations between the original and rescheduled solutions. The formulated QUBO problem is implemented on a D-Wave quantum annealer for a daily and large-scale scheduling scenario. The obtained results demonstrate significant improvements in computational efficiency and solution quality compared to traditional methods like Simulated Annealing and Tabu Search, highlighting the potential of quantum solvers in optimizing complex scheduling tasks for AEOS formations.

SN Computer Science•Aug 12, 2025•6 citations

Quantum optimization for multi-target Active Debris Removal missions

Michele Gagliardi, Mattia Boggio, Deborah Volpe +1 more

The rapid accumulation of space debris in Low Earth Orbit (LEO) poses a significant challenge to the sustainability of space operations. While preventive measures limit new debris generation, they are insufficient to mitigate the growing population of defunct satellites, rocket stages, and collision fragments. Active Debris Removal (ADR) has emerged as a viable solution, which requires solving NP-hard combinatorial optimization problem similar to the Traveling Salesman Problem (TSP) to maximize mission efficiency by minimizing fuel and mission duration. This work explores the application of Quantum Annealing (QA) and Hybrid Quantum Annealing (HQA) for optimizing multi-target ADR missions. Specifically, it introduces a Quadratic Unconstrained Binary Optimization (QUBO) model for ADR, exploiting quantum computing to enhance solution efficiency. A novel quadratization method is developed to reduce computational complexity, enabling large-scale mission planning. Additionally, a novel constraint-handling strategy is proposed, integrating mission constraints into post-processing to enhance quantum solver efficiency. The proposed approach is validated using real-world satellite debris datasets and benchmarked against classical metaheuristic optimizers, including Simulated Annealing (SA), Tabu Search (TS), and Genetic Algorithms (GA). The obtained results demonstrate the advantages of quantum optimization for ADR mission planning, providing a scalable and computationally efficient solution.

EPJ Quantum Technology•Sep 29, 2025•5 citations

Efficient Earth Observation Satellites Mission Planning with Quantum Algorithm

Jitesh Lalwani, Dana Linnet, Babita Jajodia +4 more

Earth observation satellites (EOS) play a crucial role in collecting data for applications like weather forecasting and disaster management. Optimizing EOS missions to capture high-priority targets within constraints such as storage, energy, and weather is challenging for traditional computing methods. Quantum computing shows promise in enhancing efficiency by exploring vast solution spaces for optimal schedules, even with complex constraints. This paper demonstrates the potential of a quantum algorithm to improve real-time EOS mission planning, maximizing high-priority target acquisition under resource limitations. Compared to classical algorithms like simulated annealing and Gurobi optimizer, the proposed quantum algorithm outperformed in selecting high-priority targets by 23.46%, executed faster than Gurobi by 39.09%, and successfully satisfied all constraints for all data.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Mar 22, 2024•2 citations
The increasing number of Low Earth Orbit (LEO) satellites, driven by lower manufacturing and launch costs, is proving invaluable for Earth observation missions and low-latency internet connectivity. However, as the number of satellites increases, the number of communication links to maintain also rises, making the management of this vast network increasingly challenging and highlighting the need for clustering satellites into efficient groups as a promising solution. This paper formulates the clustering of LEO satellites as a coalition structure generation (CSG) problem and leverages quantum annealing to solve it. We represent the satellite network as a graph and obtain the optimal partitions using a hybrid quantum-classical algorithm called GCS-Q. The algorithm follows a top-down approach by iteratively splitting the graph at each step using a quadratic unconstrained binary optimization (QUBO) formulation. To evaluate our approach, we utilize real-world three-line element set (TLE/3LE) data for Starlink satellites from Celestrak. Our experiments, conducted using the D-Wave Advantage annealer and the state-of-the-art solver Gurobi, demonstrate that the quantum annealer significantly outperforms classical methods in terms of runtime while maintaining the solution quality. The performance achieved with quantum annealers surpasses the capabilities of classical computers, highlighting the transformative potential of quantum computing in optimizing the management of large-scale satellite networks.
Recent studies have shown promising results indicating the potential of Noisy Intermediate Scale Quantum (NISQ) devices. In this work, Low-earth Orbit (LEO) satellite network design problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and Quantum Annealing (QA) is utilized to solve the resulting problem with real world setting. Compare to classical approaches, the experimental results indicate improvements in terms of network path length and number of satellite hops in network path that amount to network latency. Further, an iterative post-processing method, Statistical Qubit Freezing (SQF), which freezes initial states of qubits and reduces the size of the problem in each annealing cycle, is proposed and evaluated. Solution found with SQF indicates that SQF in fact allows the system to reach lower energy state.
Beam Placement (BP) is a well-known problem in Low-Earth Orbit (LEO) satellite communication (SatCom) systems, which can be modelled as an NP-hard clique cover problem. Recently, quantum computing has emerged as a novel technology which revolutionizes how to solve challenging optimization problems by formulating Quadratic Unconstrained Binary Optimization (QUBO), then preparing Hamiltonians as inputs for quantum computers. In this paper, we study how to use quantum computing to solve BP problems. However, due to limited hardware resources, existing quantum computers are unable to tackle large optimization spaces. Therefore, we propose an efficient Hamiltonian Reduction method that allows quantum processors to solve large BP instances encountered in LEO systems. We conduct our simulations on real quantum computers (D-Wave Advantage) using a real dataset of vessel locations in the US. Numerical results show that our algorithm outperforms commercialized solutions of D-Wave by allowing existing quantum annealers to solve 17.5 times larger BP instances while maintaining high solution quality. Although quantum computing cannot theoretically overcome the hardness of BP problems, this work contributes early efforts to applying quantum computing in satellite optimization problems, especially applications formulated as clique cover/graph coloring problems.
Abstract The formation of energy communities is pivotal for advancing decentralized and sustainable energy management. Within this context, coalition structure generation (CSG) emerges as a promising framework. The complexity of CSG grows rapidly with the number of agents, making classical solvers impractical for even moderate sizes. This suggests CSG as an ideal candidate for benchmarking quantum algorithms against classical ones. Facing ongoing challenges in attaining computational quantum advantage for exact optimization, we pivot our focus to benchmarking quantum and classical solvers for approximate optimization. Approximate optimization is particularly critical for industrial use cases requiring real-time optimization, where finding high-quality solutions quickly is often more valuable than achieving exact solutions more slowly. Our findings indicate that quantum annealing (QA) on DWave can achieve solutions of comparable quality to our best classical solver, but with more favorable runtime scaling, showcasing an advantage. This advantage is observed when compared to solvers, such as Tabu search, simulated annealing, and the state-of-the-art solver Gurobi in finding approximate solutions for energy community formation involving over 100 agents. DWave also surpasses 1-round QAOA on IBM hardware. Our findings represent the largest benchmark of quantum approximate optimizations for a real-world dense model beyond the hardware’s native topology, where D-Wave demonstrates a scaling advantage.
Abstract The scheduling complexity of Agile Earth Observation Satellites (AEOSs) increases significantly as Earth Observation missions progress. This makes traditional optimization techniques less effective, restricting their application to small-scale and open-loop scheduling problems. In this paper, we investigate the potential of quantum solvers to address the closed-loop scheduling problem for a formation of AEOSs, overcoming the limitations of classical optimization techniques. To this end, we formulate the scheduling problem as a novel Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e., a formulation specifically designed for quantum solvers. Moreover, penalty functions are introduced to minimize mission energy consumption and reduce deviations between the original and rescheduled solutions. The formulated QUBO problem is implemented on a D-Wave quantum annealer for a daily and large-scale scheduling scenario. The obtained results demonstrate significant improvements in computational efficiency and solution quality compared to traditional methods like Simulated Annealing and Tabu Search, highlighting the potential of quantum solvers in optimizing complex scheduling tasks for AEOS formations.
The rapid accumulation of space debris in Low Earth Orbit (LEO) poses a significant challenge to the sustainability of space operations. While preventive measures limit new debris generation, they are insufficient to mitigate the growing population of defunct satellites, rocket stages, and collision fragments. Active Debris Removal (ADR) has emerged as a viable solution, which requires solving NP-hard combinatorial optimization problem similar to the Traveling Salesman Problem (TSP) to maximize mission efficiency by minimizing fuel and mission duration. This work explores the application of Quantum Annealing (QA) and Hybrid Quantum Annealing (HQA) for optimizing multi-target ADR missions. Specifically, it introduces a Quadratic Unconstrained Binary Optimization (QUBO) model for ADR, exploiting quantum computing to enhance solution efficiency. A novel quadratization method is developed to reduce computational complexity, enabling large-scale mission planning. Additionally, a novel constraint-handling strategy is proposed, integrating mission constraints into post-processing to enhance quantum solver efficiency. The proposed approach is validated using real-world satellite debris datasets and benchmarked against classical metaheuristic optimizers, including Simulated Annealing (SA), Tabu Search (TS), and Genetic Algorithms (GA). The obtained results demonstrate the advantages of quantum optimization for ADR mission planning, providing a scalable and computationally efficient solution.
Earth observation satellites (EOS) play a crucial role in collecting data for applications like weather forecasting and disaster management. Optimizing EOS missions to capture high-priority targets within constraints such as storage, energy, and weather is challenging for traditional computing methods. Quantum computing shows promise in enhancing efficiency by exploring vast solution spaces for optimal schedules, even with complex constraints. This paper demonstrates the potential of a quantum algorithm to improve real-time EOS mission planning, maximizing high-priority target acquisition under resource limitations. Compared to classical algorithms like simulated annealing and Gurobi optimizer, the proposed quantum algorithm outperformed in selecting high-priority targets by 23.46%, executed faster than Gurobi by 39.09%, and successfully satisfied all constraints for all data.