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

White Paper: Satellite Placement Optimization Using Quantum Computing

Buvan Prajwal A, Bao Bach, Amit R. Patel, Jitesh Lalwani, Babita Jajodia

Published Jul 8, 2022• 0 citations
Publisher

Abstract

The purpose of this white paper is to discuss the problems associated with satellite placement, including space debris. The paper explains why Satellite Placement Optimization is an NP-Hard problem and how Quantum Computing can be used to solve it.
DOI
10.31219/osf.io/txqu6

Related papers

White Paper: Space Sustainability Using Quantum Computing

Buvan Prajwal A, Hirmay Sandesara, Amit R. Patel +2 more

This white paper discusses the problems associated with space debris and how Space Debris Removal Optimization can be formulated as a combination of two optimization problems (the Knapsack Problem and the Travelling Salesman Problem). This white paper also discusses how quantum computing can be applied to solve space debris problems through Space Debris Removal Optimization.

•Aug 3, 2022•0 citations

NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems

Rhonda Au-Yeung, Nicholas Chancellor, Pascal Halffmann

In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor’s algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world problems. It is likely that quantum methods can efficiently solve certain (NP-) hard optimization problems where classical approaches fail. In our perspective, we examine the field of quantum optimization, that is, solving optimization problems using quantum computers. We provide an entry point to quantum optimization for researchers from each topic, optimization or quantum computing, by demonstrating advances and obstacles with a suitable use case. We give an overview on problem formulation, available algorithms, and benchmarking. Although we show a proof-of-concept rather than a full benchmark between classical and quantum methods, this gives an idea of the current quality and capabilities of quantum computers for optimization problems. All observations are incorporated in a discussion on some recent quantum optimization breakthroughs, current status, and future directions.

arXiv:2212.10990•Frontiers in Quantum Science and Technology•Feb 23, 2023•60 citations

Quantum Optimization Methods for Satellite Mission Planning

Antón Makarov, Carlos Pérez-Herradón, Giacomo Franceschetto +5 more

Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ever-growing amount of satellites in orbit underscores the need to operate them efficiently, which requires solving many instances of the problem in short periods of time. However, current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative that could lead to significant improvements in solution quality or execution speed in the future. To this end, we study a planning problem with a variety of intricate constraints and discuss methods to encode them for quantum computers. Additionally, we experimentally assess the performance of quantum annealing and the quantum approximate optimization algorithm on a realistic and diverse dataset. Our results identify key aspects like graph connectivity and constraint structure that influence the performance of the methods. We explore the limits of today’s quantum algorithms and hardware, providing bounds on the problems that can be currently solved successfully and showing how the solution degrades as the complexity grows. This work aims to serve as a baseline for further research in the field and establish realistic expectations on current quantum optimization capabilities.

arXiv:2404.05516•IEEE Access•Jan 1, 2024•23 citations

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

Quantum Heterogeneous Computing for Satellite Positioning Optimization

Gideon Bass, Vaibhaw Kumar, Joseph Stephen Dulny

AGUFM•Dec 1, 2016•0 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
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor’s algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world problems. It is likely that quantum methods can efficiently solve certain (NP-) hard optimization problems where classical approaches fail. In our perspective, we examine the field of quantum optimization, that is, solving optimization problems using quantum computers. We provide an entry point to quantum optimization for researchers from each topic, optimization or quantum computing, by demonstrating advances and obstacles with a suitable use case. We give an overview on problem formulation, available algorithms, and benchmarking. Although we show a proof-of-concept rather than a full benchmark between classical and quantum methods, this gives an idea of the current quality and capabilities of quantum computers for optimization problems. All observations are incorporated in a discussion on some recent quantum optimization breakthroughs, current status, and future directions.
Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ever-growing amount of satellites in orbit underscores the need to operate them efficiently, which requires solving many instances of the problem in short periods of time. However, current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative that could lead to significant improvements in solution quality or execution speed in the future. To this end, we study a planning problem with a variety of intricate constraints and discuss methods to encode them for quantum computers. Additionally, we experimentally assess the performance of quantum annealing and the quantum approximate optimization algorithm on a realistic and diverse dataset. Our results identify key aspects like graph connectivity and constraint structure that influence the performance of the methods. We explore the limits of today’s quantum algorithms and hardware, providing bounds on the problems that can be currently solved successfully and showing how the solution degrades as the complexity grows. This work aims to serve as a baseline for further research in the field and establish realistic expectations on current quantum optimization capabilities.
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.
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.