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: Space Sustainability Using Quantum Computing

Buvan Prajwal A, Hirmay Sandesara, Amit R. Patel, Jitesh Lalwani, Babita Jajodia

Published Aug 3, 2022• 0 citations
Publisher

Abstract

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.

DOI
10.31219/osf.io/wndfb

Related papers

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

White Paper: Satellite Placement Optimization Using Quantum Computing

Buvan Prajwal A, Bao Bach, Amit R. Patel +2 more

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.

•Jul 8, 2022•0 citations

Optimisation of Active Space Debris Removal Missions With Multiple Targets Using Quantum Annealing

Swain, Thomas

A strategy for the analysis of active debris removal missions targeting multiple objects from a set of objects in near-circular orbit with similar inclination is presented. Algebraic techniques successfully reduce the orbital mechanics regarding specific inter-debris transfer and disposal methods to simple computations, which can be used as the coefficients of a quadratic unconstrained binary optimisation (QUBO) problem formulation which minimises the total propellant used in the mission whilst allowing for servicing time and meeting the mission deadline. The QUBO is validated by solving artificial small problems (from 2 to 11 debris) using classical computational methods and the weaknesses in using these methods are examined prior to solution using quantum annealing hardware. The quantum processing unit (QPU) and quantum-classical hybrid solvers provided by D-Wave are then used to solve the same small problems, with attention paid to evident strengths and weaknesses of each approach. Hybrid solvers are found to be significantly more effective at solving larger problems. Finally, the hybrid method is used to solve a large problem using a real dataset. From a set of 79 debris objects resulting from the destruction of the Kosmos-1408 satellite, an active debris removal mission starting on 30 September 2023 targeting 5 debris objects for disposal within a year with 20 days servicing time per object is successfully planned. This plan calculates the total propellant cost of transfer and disposal to be 0.87km/s and would be complete well within the deadline at 241 days from the start date. This problem uses 6,478 binary variables in total and is solved using around 25s of QPU access time.

arXiv:2311.01852•Nov 3, 2023•4 citations

Employing continuous quantum systems to solve optimization problems

Alexander Sauer, Sebastian Luhn, Jannes Weghake

At land, sea and in the air mobility and traffic management offer a vast amount of problems with a large potential of optimization with quantum computers, e.g. service scheduling, route planning, or path optimization. Many of these problems can be described at a fundamental level by the traveling salesman problem (TSP), in which the shortest route while visiting each point exactly once is to be found [1]. The TSP has already received a lot of attention in the quantum computing community, for example, implementations for adiabatic quantum annealers exist and have been tested [2,3]. We investigate the TSP with a focus on going beyond qubits by employing continuous quantum systems. Using bosonic Qiskit we simulate potential algorithms for solving the TSP and compare their performance. [1] Flood, M. M., The traveling-salesman problem. Operations research, 4(1), 61-75, (1956). [2] Martoňák, Roman, Giuseppe E. Santoro, and Erio Tosatti., Quantum annealing of the traveling-salesman problem. Physical Review E 70.5: 057701, (2004). [3] Jain, S., Solving the traveling salesman problem on the d-wave quantum computer. Frontiers in Physics, 646, (2021).

•Mar 13, 2024•0 citations

Quantum Knapsack: Optimizing Resource Allocation with QAOA

Mahfouz, Zein, Bhaskaran Potty Thulasi Lakshmi, Sreedevi

Combinatorial Optimization (CO) is one of the most important areas in the field of optimization, with practical applications found in every industry, including both the private and public sectors. In recent years, it was discovered that a mathematical formulation known as QUBO (Quadratic Unconstrained Binary Optimization) problem can embrace an exceptional variety of important CO problems found in the industry. In this work, we explore the Quantum Approximate Optimization Algorithm (QAOA) as a quantum computing approach to solve the Knapsack Problem efficiently by formulating the problem as a QUBO model. Here we implemented QAOA on a quantum emulator, leveraging quantum superposition and entanglement to explore multiple solutions simultaneously. The method offers a promising route for solving large, complex scheduling and resource allocation problems that are tough for classical algorithms, with potential applications in logistics, HPC resource scheduling, and energy optimization.

•Nov 17, 2025•0 citations

Introduction to Quantum Optimization

Alberto Moraglio, Francisco Chicano

include quantum computing, the application of search techniques to Software Engineering problems and the use of theoretical results to efficiently solve combinatorial optimization problems.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 15, 2023•0 citations
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.
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.
A strategy for the analysis of active debris removal missions targeting multiple objects from a set of objects in near-circular orbit with similar inclination is presented. Algebraic techniques successfully reduce the orbital mechanics regarding specific inter-debris transfer and disposal methods to simple computations, which can be used as the coefficients of a quadratic unconstrained binary optimisation (QUBO) problem formulation which minimises the total propellant used in the mission whilst allowing for servicing time and meeting the mission deadline. The QUBO is validated by solving artificial small problems (from 2 to 11 debris) using classical computational methods and the weaknesses in using these methods are examined prior to solution using quantum annealing hardware. The quantum processing unit (QPU) and quantum-classical hybrid solvers provided by D-Wave are then used to solve the same small problems, with attention paid to evident strengths and weaknesses of each approach. Hybrid solvers are found to be significantly more effective at solving larger problems. Finally, the hybrid method is used to solve a large problem using a real dataset. From a set of 79 debris objects resulting from the destruction of the Kosmos-1408 satellite, an active debris removal mission starting on 30 September 2023 targeting 5 debris objects for disposal within a year with 20 days servicing time per object is successfully planned. This plan calculates the total propellant cost of transfer and disposal to be 0.87km/s and would be complete well within the deadline at 241 days from the start date. This problem uses 6,478 binary variables in total and is solved using around 25s of QPU access time.
At land, sea and in the air mobility and traffic management offer a vast amount of problems with a large potential of optimization with quantum computers, e.g. service scheduling, route planning, or path optimization. Many of these problems can be described at a fundamental level by the traveling salesman problem (TSP), in which the shortest route while visiting each point exactly once is to be found [1]. The TSP has already received a lot of attention in the quantum computing community, for example, implementations for adiabatic quantum annealers exist and have been tested [2,3]. We investigate the TSP with a focus on going beyond qubits by employing continuous quantum systems. Using bosonic Qiskit we simulate potential algorithms for solving the TSP and compare their performance. [1] Flood, M. M., The traveling-salesman problem. Operations research, 4(1), 61-75, (1956). [2] Martoňák, Roman, Giuseppe E. Santoro, and Erio Tosatti., Quantum annealing of the traveling-salesman problem. Physical Review E 70.5: 057701, (2004). [3] Jain, S., Solving the traveling salesman problem on the d-wave quantum computer. Frontiers in Physics, 646, (2021).
Combinatorial Optimization (CO) is one of the most important areas in the field of optimization, with practical applications found in every industry, including both the private and public sectors. In recent years, it was discovered that a mathematical formulation known as QUBO (Quadratic Unconstrained Binary Optimization) problem can embrace an exceptional variety of important CO problems found in the industry. In this work, we explore the Quantum Approximate Optimization Algorithm (QAOA) as a quantum computing approach to solve the Knapsack Problem efficiently by formulating the problem as a QUBO model. Here we implemented QAOA on a quantum emulator, leveraging quantum superposition and entanglement to explore multiple solutions simultaneously. The method offers a promising route for solving large, complex scheduling and resource allocation problems that are tough for classical algorithms, with potential applications in logistics, HPC resource scheduling, and energy optimization.