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

arXiv:2410.19467

Quantum optimization for Nonlinear Model Predictive Control

Carlo Novara, Mattia Boggio, Deborah Volpe

Published Oct 25, 2024• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2410.19467

Related papers

A quantum optimization approach to Nonlinear Model Predictive Control

Carlo Novara, Mattia Boggio, Deborah Volpe

We propose a quantum computing approach for the solution of NMPC optimization problems. Assuming the availability of an efficient quantum computer, the approach can considerably decrease the computational time and/or enhance the solution quality compared to classical algorithms. The approach is illustrated by means of a simulation example, concerned with automated driving. The results show that the approach can substantially reduce the computational cost of optimization-based methods.

European Control Conference (ECC)•Jun 24, 2025•5 citations

Real-Time Quantum-Inspired Nonlinear Model Predictive Control via Quantum Singular Value Transformation for Autonomous Systems

Khotsofalang Nqhoaki, Terry Wilding

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.

•Oct 1, 2026•0 citations

A Model Predictive Control-Inspired Quantum Algorithm

Dominic Messina, Alicia B. Magann, Mohan Sarovar +1 more

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.

quant-pharXiv:2607.24992•Jul 29, 2026•0 citations

Investigating an amplitude amplification-based optimization algorithm for model predictive control

Kip Nieman, Helen Durand, Saahil Patel +2 more

The potential for greater algorithmic efficiency for some problems on quantum computers compared to classical computers is appealing in many fields including, for example, the process systems engineering field. While quantum algorithms have been studied for a variety of applications related to optimization, molecular modeling, and machine learning, there remain many applications in process systems engineering, including process control, where it is not clear how quantum computing algorithms would be beneficial. One idea for attempting to understand when a quantum algorithm might provide benefits for control is to start with algorithms that would be expected to benefit “similar” problems (e.g., optimization problems) and to see if controllers can be implemented within those algorithmic frameworks. Therefore, in this work, we study the use of a quantum computing algorithm related to Grover’s algorithm, which is an amplitude amplification strategy that can search an unordered list with improved efficiency compared to a classical algorithm for the task. It has been extended to perform a search for optimal paths over a graph. Given its potential utility for search and optimization, this is an example of an algorithm where we might wonder if it could be adjusted or used to provide speed-ups for large control problems if the controller could function within this algorithmic framework. This work provides the first steps toward attempting to address this question by investigating how optimization-based control problems would fit into this framework. A process described by ẋ=x+u is considered as a test case. The modified Grover’s algorithm requires the optimization problem to be mapped into quantum gates. We discuss ideas for attempting to represent an optimization-based controller known as model predictive control (MPC) in the modified Grover’s algorithm framework. We test how various parameters of the control and quantum algorithm designs, including fundamental parameters in MPC such as the number of sampling periods and length of the sampling periods, impact the success of using the quantum algorithm for the MPC. We provide analyses regarding why the results are what they are to give perspective on how quantum computing algorithms work and intersect with engineering problems.

Digital Chemical Engineering•Nov 23, 2023•9 citations

Quantum Computing Algorithms for Nonlinear Optimization Problems

Vinod Kumar Vishwakarma

The increasing complexity of real-world optimization problems highlights the importance of this research since classical algorithms are unable to provide efficient answers in these cases. Innovative methods for fast and scalable resolution of nonlinear optimization problems are required because these problems are prevalent in many fields. The potential for quantum computing to speed up optimization processes and overcome classical limitations is great, owing to its superposition principles and intrinsic parallelism. The integration of quantum algorithms (I-QA) into real-world applications, however, will not always be smooth sailing. There are significant challenges associated with preserving quantum coherence, correcting errors, and working within hardware limits. To enable the simultaneous exploration of solution spaces through quantum parallelism, this research proposes the Hybrid Quantum Gradient -Classical Approach (HQG-CA), which makes use of parameterized quantum circuits to represent probable solutions. Additionally, improves convergence rates through applying quantum gradient information to direct optimization in the quantum state space. Optimization of portfolios in finance, adjustment of model parameters in machine learning, and optimization of routes in logistics are a few examples of the many industries that find use for HQG-CA. These applications are explored in this abstract, which highlights the revolutionary potential of HQG-CA to solve optimization problems in the real world. The effectiveness of HQG-CA is assessed through a thorough simulation experiment. Performance measures such algorithmic speedup, solution accuracy, and scalability are discussed, which is based on extensive testing and comparison with classical alternatives. The present research provides a comprehensive evaluation of HQG-CA's potential for tackling nonlinear optimization problems.

Communications on Applied Nonlinear Analysis•Dec 27, 2023•3 citations

Model predictive quantum control: a modular approach for efficient and robust quantum optimal control

Eya Guizani, Julian Berberich

Abstract Model predictive control (MPC) is one of the most successful modern control methods. It relies on repeatedly solving a finite-horizon optimal control problem and applying the beginning piece of the optimal input. In this paper, we develop a modular framework for improving efficiency and robustness of quantum optimal control (QOC) via MPC. We first provide a tutorial introduction to basic concepts of MPC from a QOC perspective. We then present multiple MPC schemes, ranging from simple approaches to more sophisticated schemes which admit stability guarantees. This yields a modular framework which can be used 1) to improve efficiency of open-loop QOC and 2) to improve robustness of closed-loop quantum control by incorporating feedback. We demonstrate these benefits with numerical results, where we benchmark the proposed methods against competing approaches.

arXiv:2509.05167•New Journal of Physics•Oct 1, 2026•2 citations
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.
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)(F(7,232)=42.3, p<0.001)(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 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.
The potential for greater algorithmic efficiency for some problems on quantum computers compared to classical computers is appealing in many fields including, for example, the process systems engineering field. While quantum algorithms have been studied for a variety of applications related to optimization, molecular modeling, and machine learning, there remain many applications in process systems engineering, including process control, where it is not clear how quantum computing algorithms would be beneficial. One idea for attempting to understand when a quantum algorithm might provide benefits for control is to start with algorithms that would be expected to benefit “similar” problems (e.g., optimization problems) and to see if controllers can be implemented within those algorithmic frameworks. Therefore, in this work, we study the use of a quantum computing algorithm related to Grover’s algorithm, which is an amplitude amplification strategy that can search an unordered list with improved efficiency compared to a classical algorithm for the task. It has been extended to perform a search for optimal paths over a graph. Given its potential utility for search and optimization, this is an example of an algorithm where we might wonder if it could be adjusted or used to provide speed-ups for large control problems if the controller could function within this algorithmic framework. This work provides the first steps toward attempting to address this question by investigating how optimization-based control problems would fit into this framework. A process described by ẋ=x+u is considered as a test case. The modified Grover’s algorithm requires the optimization problem to be mapped into quantum gates. We discuss ideas for attempting to represent an optimization-based controller known as model predictive control (MPC) in the modified Grover’s algorithm framework. We test how various parameters of the control and quantum algorithm designs, including fundamental parameters in MPC such as the number of sampling periods and length of the sampling periods, impact the success of using the quantum algorithm for the MPC. We provide analyses regarding why the results are what they are to give perspective on how quantum computing algorithms work and intersect with engineering problems.
The increasing complexity of real-world optimization problems highlights the importance of this research since classical algorithms are unable to provide efficient answers in these cases. Innovative methods for fast and scalable resolution of nonlinear optimization problems are required because these problems are prevalent in many fields. The potential for quantum computing to speed up optimization processes and overcome classical limitations is great, owing to its superposition principles and intrinsic parallelism. The integration of quantum algorithms (I-QA) into real-world applications, however, will not always be smooth sailing. There are significant challenges associated with preserving quantum coherence, correcting errors, and working within hardware limits. To enable the simultaneous exploration of solution spaces through quantum parallelism, this research proposes the Hybrid Quantum Gradient -Classical Approach (HQG-CA), which makes use of parameterized quantum circuits to represent probable solutions. Additionally, improves convergence rates through applying quantum gradient information to direct optimization in the quantum state space. Optimization of portfolios in finance, adjustment of model parameters in machine learning, and optimization of routes in logistics are a few examples of the many industries that find use for HQG-CA. These applications are explored in this abstract, which highlights the revolutionary potential of HQG-CA to solve optimization problems in the real world. The effectiveness of HQG-CA is assessed through a thorough simulation experiment. Performance measures such algorithmic speedup, solution accuracy, and scalability are discussed, which is based on extensive testing and comparison with classical alternatives. The present research provides a comprehensive evaluation of HQG-CA's potential for tackling nonlinear optimization problems.
Abstract Model predictive control (MPC) is one of the most successful modern control methods. It relies on repeatedly solving a finite-horizon optimal control problem and applying the beginning piece of the optimal input. In this paper, we develop a modular framework for improving efficiency and robustness of quantum optimal control (QOC) via MPC. We first provide a tutorial introduction to basic concepts of MPC from a QOC perspective. We then present multiple MPC schemes, ranging from simple approaches to more sophisticated schemes which admit stability guarantees. This yields a modular framework which can be used 1) to improve efficiency of open-loop QOC and 2) to improve robustness of closed-loop quantum control by incorporating feedback. We demonstrate these benefits with numerical results, where we benchmark the proposed methods against competing approaches.