Quantum classical method improves multi target space debris removal planning

A Topology-Aware Quantum-Classical Framework for Multi-Target Active Debris Removal using Gaussian Boson Sampling

Computational Engineering, Finance, and ScienceEmerging Technologies

Summary

Space debris around Earth is a growing problem that threatens satellites and other spacecraft. The authors introduce a new method combining quantum computing techniques and classical optimization to carefully select and order multiple debris targets for removal missions. Their approach uses information about how debris move in orbit and smart sampling methods to reduce the search space, making the complex planning more efficient. They tested this method on simulated debris scenarios showing how different strategies affect mission design and performance.

What this means in practice

  • For space mission planners: Plan multi-target debris removal missions efficiently by combining quantum sampling with classical trajectory optimization to reduce computational costs.
  • For orbital operations teams: Identify and sequence high-priority debris targets by incorporating topology and risk factors into mission scheduling to optimize fuel use and mission duration.

Authors

Komal Pandya, Saiyam Sakhuja, Nagaraj Kattian

Abstract

The continued growth of orbital debris threatens the safety and sustainability of near-Earth space, making Active Debris Removal (ADR) an important mitigation strategy. Selecting $k$ targets from $N$ candidates yields a combinatorial search space of size $\binom{N}{k}$, making joint target selection and mission sequencing computationally demanding. We present a topology-aware quantum-classical framework integrating orbital mechanics, weighted orbital-transfer graphs, Gaussian Boson Sampling (GBS), and multi-objective evolutionary optimization. Seven target-prioritization strategies represent physical consequence, orbital persistence, conjunction risk, network centrality, community structure, inferred source families, and random selection. GBS generates candidate target subsets from the weighted graph, which are then evaluated using PyGMO-based evolutionary optimization to identify servicing sequences that jointly minimize total velocity increment ($Δv$) and mission duration, accounting for modeled timing, propulsion, and mass feasibility. We evaluate the framework across three benchmark environments, SOCRATES Minefield, Collision Cloud, and Random, with candidate-pool sizes $N\in\{15,18,22,25\}$ and target cardinalities $k\in\{3,5\}$. The experiments characterize how benchmark topology, prioritization strategy, and problem scale relate to sampling behavior and downstream mission performance. By separating candidate-subset generation from detailed trajectory optimization, the framework offers a topology-aware approach to focusing computational effort on a limited set of candidate ADR missions.