Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming
Abstract
Low-thrust trajectory optimization is a central task in interplanetary mission design, but its nonlinear dynamics and operational constraints often lead to challenging non-convex optimal-control problems. Sequential convex programming has emerged as an effective approach to address these problems, while quantum annealing offers a complementary paradigm for solving quadratic unconstrained binary optimization problems. This paper introduces quSCP, a quantum-based sequential convex programming framework that reformulates each convex subproblem as a quadratic unconstrained binary optimization problem suitable for quantum and hybrid quantum--classical solvers. Equality, inequality, and trust-region constraints are embedded through quadratic penalty terms, while an iterative refinement strategy is used to reduce the accuracy loss introduced by binary discretization. The method is assessed on a fuel-optimal Earth--Mars low-thrust transfer by comparing standard sequential convex programming, a continuous quadratic unconstrained formulation, direct quantum processing unit sampling, and D-Wave hybrid solvers. Results show that quSCP produces physically consistent trajectories with propellant consumption and nonlinear constraint violations close to classical benchmarks. Direct quantum annealing is feasible only for small instances because of embedding overhead and hardware connectivity limits, whereas hybrid solvers scale to larger discretizations. Although no computational quantum advantage is demonstrated with current hardware, the results show that quantum and hybrid quantum--classical optimization can already provide competitive solutions for demanding trajectory design problems.
Related
- A sequential quadratic programming method for optimization with expectation objective functions, deterministic inequality constraints and robust subproblems
- Beyond QAOA: A Review of AI and Quantum Computing for Adaptive Combinatorial Optimization
- Integer linear programming based methods for computing the maximum chordal subgraph of an arbitrary graph
- Learning to Solve Mixed-Integer Nonlinear Programming with Neural Networks and Sequential Quadratic Programming Refinement
- Computing Invariant Reachable Sets through Sum-of-Squares Programming
BibTeX
@misc{giordano2026lowthrust,
title = {{Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming}},
author = {Carmine Giordano},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.00861},
eprint = {2609.00861},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.00861},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming
AU - Carmine Giordano
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.00861
UR - https://arxiv.org/abs/2609.00861
AB - Low-thrust trajectory optimization is a central task in interplanetary mission design, but its nonlinear dynamics and operational constraints often lead to challenging non-convex optimal-control problems. Sequential convex programming has emerged as an effective approach to address these problems, while quantum annealing offers a complementary paradigm for solving quadratic unconstrained binary optimization problems. This paper introduces quSCP, a quantum-based sequential convex programming framework that reformulates each convex subproblem as a quadratic unconstrained binary optimization problem suitable for quantum and hybrid quantum--classical solvers. Equality, inequality, and trust-region constraints are embedded through quadratic penalty terms, while an iterative refinement strategy is used to reduce the accuracy loss introduced by binary discretization. The method is assessed on a fuel-optimal Earth--Mars low-thrust transfer by comparing standard sequential convex programming, a continuous quadratic unconstrained formulation, direct quantum processing unit sampling, and D-Wave hybrid solvers. Results show that quSCP produces physically consistent trajectories with propellant consumption and nonlinear constraint violations close to classical benchmarks. Direct quantum annealing is feasible only for small instances because of embedding overhead and hardware connectivity limits, whereas hybrid solvers scale to larger discretizations. Although no computational quantum advantage is demonstrated with current hardware, the results show that quantum and hybrid quantum--classical optimization can already provide competitive solutions for demanding trajectory design problems.
ER -