We propose a quantum-assisted framework for solving constrained finite-horizon nonlinear optimal control problems using a barrier Sequential Quadratic Programming (SQP) approach. A quantum subroutine is incorporated to efficiently solve the Schur complement step using block-encoding and Quantum Singular Value Transformation techniques. We formally analyze the time complexity and convergence behavior under the cumulative effect of quantum errors, establishing local input-to-state stability and convergence to a neighborhood of the stationary point, with explicit error bounds in terms of the barrier parameter and quantum solver accuracy. The proposed framework enables computational complexity to scale polylogarithmically with the system dimension demonstrating the potential of quantum algorithms to enhance classical optimization routines in nonlinear control applications.
We propose a quantum-assisted framework for solving constrained finite-horizon nonlinear optimal control problems using a barrier Sequential Quadratic Programming (SQP) approach. A quantum subroutine is incorporated to efficiently solve the Schur complement step using block-encoding and Quantum Singular Value Transformation techniques. We formally analyze the time complexity and convergence behavior under the cumulative effect of quantum errors, establishing local input-to-state stability and convergence to a neighborhood of the stationary point, with explicit error bounds in terms of the barrier parameter and quantum solver accuracy. The proposed framework enables computational complexity to scale polylogarithmically with the system dimension demonstrating the potential of quantum algorithms to enhance classical optimization routines in nonlinear control applications.
We present a quantum algorithm for solving the finite-horizon discrete-time Linear Quadratic Gaussian (LQG) control problem, which integrates optimal control and state estimation in the presence of stochastic disturbances and noise. Classical approaches to LQG require solving a backward Riccati recursion and a forward Kalman filter, both requiring computationally expensive matrix operations with overall time complexityO(Tn3), wherenis the system dimension andTis the time horizon. While efficient classical solvers exist, especially for small to medium-sized systems, their computational complexity grows rapidly with system dimension. To address this, we reformulate the full LQG pipeline using quantum linear algebra primitives, including block-encoded matrix representations and quantum singular value transformation (QSVT) techniques for matrix inversion and multiplication. We formally analyze the time complexity of each algorithmic component. Under standard assumptions on matrix condition numbers and encoding precision, the total runtime of the quantum LQG algorithm scales polylogarithmically with the system dimensionnand linearly with the time horizonT, offering an asymptotic quantum speedup over classical methods.
We develop quantum algorithms for optimal control over a prescribed finite time interval (finite horizon), focusing on continuous-time linear-quadratic regulation (LQR). This foundational control problem often requires solving a nonlinear matrix Riccati equation, which can be costly for large systems and long control durations on conventional classical solvers. We instead work directly with the state-costate optimality equations, reformulating the LQR problem as a multiple-shooting linear system. Importantly, we prove a condition-number bound for the system that is independent of the horizon, under stabilizability and detectability assumptions. By incorporating the initial and final conditions into a single linear system, we can solve the subsequent linear system more efficiently with a quantum linear systems subroutine. For a given initial state, our quantum algorithms return classical estimates of the optimal cost and the optimal control inputs at a selected time, without constructing a Riccati solution operator. Given sparse-matrix block-encodings, an initial-state preparation oracle and a fixed number of control inputs, the query and gate complexities scale polylogarithmically with system size and control duration, provided that sparsity, relevant norms, and stability parameters are bounded. The dependence on the target error is inverse-linear up to logarithmic factors. We establish the required bounds uniformly in system size and duration for a family of damped mass-spring chains with two endpoint controls. Numerical experiments support the analysis.
The deployment of Nonlinear Model Predictive Control (NMPC) in safety-critical autonomous systems is fundamentally constrained by the computational intractability of solving non-convex optimization problems within strict real-time deadlines. While quantum computing offers theoretical speedups, the lack of fault-tolerant hardware necessitates the development of quantum-inspired classical algorithms. This paper presents a novel NMPC framework based on the Quantum Singular Value Transformation (QSVT), which leverages Chebyshev polynomial approximation and matrix sketching to accelerate the solution of receding-horizon control problems. A comprehensive theoretical complexity analysis demonstrates reduction from the cubic complexity of classical Sequential Quadratic Programming (SQP) to near-linear complexity dependent on sketch dimensions. The proposed QSVT-NMPC is rigorously benchmarked against classical NMPC, Sliding Mode Control (SMC), and a suite of quantum-inspired variants including Simulated Quantum Annealing, Variational Quantum Circuits, and Random Fourier Features on the canonical inverted pendulum system. Experimental results validate that the optimized QSVT-NMPC achieves a median settling time of 3.0 seconds, outperforming other quantum-inspired methods and offering a superior tradeoff between control stability and computational latency compared to classical approaches. Statistical analysis using ANOVA(F(7,232)=42.3,p<0.001)confirms significant performance advantages. The algorithm demonstrates 65% improvement over its unoptimized form, maintains sub-8ms computation latency, shows robust performance under ±20% mass perturbation (6.7% degradation), and reduces memory footprint by 75%, establishing it as the first viable candidate for embedded implementation of advanced predictive control in next-generation autonomous systems.
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.
Partial differential equation (PDE)-constrained optimization, where an optimization problem is subject to PDE constraints, arises in various applications such as design, control, and inference. Solving such problems is computationally demanding because it requires repeatedly solving a PDE and using its solution within an optimization process. In this paper, we first propose a fully coherent quantum algorithm for solving PDE-constrained optimization problems. The proposed method combines a quantum PDE solver that prepares the solution vector as a quantum state, and a quantum optimizer that assumes oracle access to a quantized objective function. The central idea is the explicit construction of the oracle in a form of block-encoding for the objective function, which coherently uses the output of a quantum PDE solver. This enables us to avoid classical access to the full solution that requires quantum state tomography canceling out the potential quantum speedups. We also derive the overall computational complexity of the proposed method with respect to parameters for optimization and PDE simulation, where quantum speedup is inherited from the underlying quantum PDE solver. We numerically demonstrate the validity of the proposed method by applications, including a parameter calibration problem in the Black-Scholes equation and a material parameter design problem in the wave equation. This work presents the concept of composing quantum subroutines so that the weakness of one (i.e., prohibitive readout overhead) is neutralized by the strength of another (i.e., coherent oracle access), toward a bottleneck-free quantum algorithm.
This work proposes an end-to-end framework for the learning-enabled control of closed quantum systems. The proposed learning technique is the first of its kind to utilize a hierarchical design which layers probing control, quantum state tomography, quantum process tomography, and Hamiltonian learning to identify both the internal and control Hamiltonians. Within this context, a novel quantum process tomography algorithm is presented which involves optimization on the unitary group, i.e., the space of unitary operators, to ensure physically meaningful predictions. Our scalable Hamiltonian learning algorithms have low memory requirements and tunable computational complexity. Once the Hamiltonians are learned, we formalize data-driven model-predictive quantum control (MPQC). This technique utilizes the learned model to compute quantum control parameters in a closed-loop simulation. Then, the optimized control input is given to a physical quantum system in an open-loop fashion. Simulations show model-predictive quantum control to be more efficient than the current state-of-the-art, quantum optimal control, when sequential quadratic programming (SQP) is used to solve each control problem.