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.
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.
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.
Nonlinear Model Predictive Control (NMPC) is a general and flexible control approach, used in many industrial contexts, and is based on the online solution of a nonlinear optimization problem. This operation requires in general a high computational cost, which may compromise the NMPC implementation in ``fast'' applications, especially if a large number variables is involved. To overcome this issue, we propose a quantum computing approach for the solution of the NMPC optimization problem. Assuming the availability of an efficient quantum computer, the approach has the potential to considerably decrease the computational time and/or enhance the solution quality compared to classical algorithms.
We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block encoding, incurring an intrinsic O(logL) ancilla overhead and circuit depth O(Ldλ) for polynomial transformations of a Hamiltonian H=∑k=1LHk, where d is the polynomial degree and λ=∑k∥Hk∥. We introduce a simple yet powerful approach that utilizes only basic Hamiltonian simulation techniques, namely, Trotter methods, to: (i) eliminate the need for block encoding, (ii) reduce the ancilla overhead to only a single qubit, and (iii) still maintain near-optimal complexity. Our method achieves a circuit depth of O(L(dλcomm)1+o(1)), without requiring any complicated multi-qubit controlled gates. Moreover, λcomm depends on the nested commutators of the terms of H and can be substantially smaller than λ for many physically relevant Hamiltonians, a feature absent in standard QSVT. To achieve these results, we make use of Richardson extrapolation in a novel way, systematically eliminating errors in any interleaved sequence of arbitrary unitaries and Hamiltonian evolution operators, thereby establishing a general framework that encompasses QSVT but is more broadly applicable. As applications, we develop end-to-end quantum algorithms for solving linear systems and estimating ground state properties of Hamiltonians, both achieving near-optimal complexity without relying on oracular access. Overall, our results establish a new framework for quantum algorithms, significantly reducing hardware overhead while maintaining near-optimal performance, with implications for both near-term and fault-tolerant quantum computing.
We introduce the first randomized algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework for many quantum algorithms. Standard implementations of QSVT rely on block encodings of the Hamiltonian, which are costly to construct, requiring a logarithmic number of ancilla qubits, intricate multi-qubit control, and circuit depth scaling linearly with the number of Hamiltonian terms. In contrast, our algorithms use only a single ancilla qubit and entirely avoid block encodings. We develop two methods: (i) a direct randomization of QSVT, where block encodings are replaced by importance sampling, and (ii) an approach that integrates qDRIFT into the generalized quantum signal processing framework, with the dependence on precision exponentially improved through classical extrapolation. Both algorithms achieve gate complexity independent of the number of Hamiltonian terms, a hallmark of randomized methods, while incurring only quadratic dependence on the degree of the target polynomial. We identify natural parameter regimes where our methods outperform even standard QSVT, making them promising for early fault-tolerant quantum devices. We also establish a fundamental lower bound showing that the quadratic dependence on the polynomial degree is optimal within this framework. We apply our framework to two fundamental tasks: solving quantum linear systems and estimating ground-state properties of Hamiltonians, obtaining polynomial advantages over prior randomized algorithms. Finally, we benchmark our ground-state property estimation algorithm on electronic structure Hamiltonians and the transverse-field Ising model with long-range interactions. In both cases, our approach outperforms prior work by several orders of magnitude in circuit depth, establishing randomized QSVT as a practical and resource-efficient alternative for early fault-tolerant quantum devices.