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.
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.
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)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 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.
Quantum computing, leveraging quantum mechanics, promises to enhance optimization processes in artificial intelligence (AI) by addressing challenges faced by classical computing in solving complex problems. This study investigates the role of quantum computing in optimizing AI tasks, focusing on algorithms such as Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) for improved efficiency in optimization. A hybrid quantum-classical approach was used to evaluate the performance of quantum algorithms in optimization tasks, including combinatorial optimization and machine learning model tuning. QAOA and QA were applied to benchmark problems, such as Max-Cut and Traveling Salesman Problem (TSP). The study involved a comparative analysis between quantum algorithms and classical optimization techniques using performance metrics like solution quality, computational time, and scalability. Data were gathered through simulation on a quantum computing platform, and results were analyzed using statistical methods to assess improvements. The results showed that quantum computing significantly outperformed classical methods in solving large-scale optimization problems. QAOA demonstrated a 30% improvement in solution quality for Max-Cut problems, and QA showed a 25% faster convergence in TSP compared to classical algorithms. Quantum algorithms demonstrated scalability advantages as the problem size increased, with quantum methods achieving up to a 40% reduction in computational time for large instances. Furthermore, 70% of the tested cases showed significant improvements in solution accuracy, confirming the potential of quantum computing in real-world AI applications. Quantum computing, through QAOA and QA, offers substantial improvements in solving complex optimization problems in AI, presenting a transformative opportunity for the future of optimization algorithms.
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.
Abstract: Quantum-enhanced optimization via Variational Quantum Eigensolver (VQE) aims to accelerate the solution of complex optimization problems, particularly in quantum chemistry. This paper presents a novel VQE-based optimization algorithm that utilizes quantum tunneling to enhance the exploration of the solution space, thereby reducing computational cost and improving efficiency. We demonstrate the effectiveness of this approach through theoretical analysis and preliminary simulations on a set of benchmark problems. The core mechanism involves exploiting quantum tunneling to navigate the solution space more effectively, leading to substantial improvements in convergence speed and solution quality compared to classical optimization methods. We discuss the challenges and potential future directions of this research.