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 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.
A critical engineering challenge in quantum technology is the accurate control of quantum dynamics. Model-based methods for optimal control have been shown to be highly effective when theory and experiment closely match. Consequently, realizing high-fidelity quantum processes with model-based control requires careful device characterization. In quantum processors based on cold atoms, the Hamiltonian can be well-characterized. For superconducting qubits operating at milli-Kelvin temperatures, the Hamiltonian is not as well-characterized. Unaccounted for physics (i.e., mode discrepancy), coherent disturbances, and increased noise compromise traditional model-based control. This work introduces model predictive control (MPC) for quantum control applications. MPC is a closed-loop optimization framework that (i) inherits a natural degree of disturbance rejection by incorporating measurement feedback, (ii) utilizes finite-horizon model-based optimizations to control complex multi-input, multi-output dynamical systems under state and input constraints, and (iii) is flexible enough to develop synergistically alongside other modern control strategies. We show how MPC can be used to generate practical optimized control sequences in representative examples of quantum state preparation. Specifically, we demonstrate for a qubit, a weakly-anharmonic qubit, and a system undergoing crosstalk, that MPC can realize successful model-based control even when the model is inadequate. These examples showcase why MPC is an important addition to the quantum engineering control suite.
This article presents a robust control strategy using Time-Optimal Model Predictive Control (TOMPC) for a two-level quantum system subject to bounded uncertainties. In this method, the control field is optimized over a finite horizon using a nominal quantum system as the reference and then the optimal control for the first time interval is applied and a projective measurement is implemented on the uncertain system. The new control field for the next time interval will be iteratively optimized based on the measurement result. We present theoretical results to guarantee the stability of the TOMPC algorithm. We also characterize the robustness and the convergence rate of the TOMPC strategy for the control of two-level systems. Numerical simulations further demonstrate that, in the presence of uncertainties, our quantum TOMPC algorithm enhances robustness and steers the state to the desired state with high fidelity. This work contributes to the progress of Model Predictive Control in quantum control and explores its potential in practical applications of quantum technology.
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 application of Model Predictive Control (MPC) to quantum systems faces fundamental challenges arising from measurement-induced disturbances and the probabilistic nature of quantum dynamics. Unlike classical nonlinear systems, quantum measurements inherently disturb the system state, making feedback control intrinsically model-dependent and stochastic. Within the framework of Positive Operator-Valued Measures (POVMs), this thesis focuses on strong quantum measurements, where each observation induces a complete state collapse on the system. When uncertainty is introduced, the measurement process itself becomes a dominant source of disturbance. To address this, a lower bound on the measurement uncertainty is imposed, quantified as the predicted deviation between the measured quantum state and the nominal MPC trajectory, ensuring that the quantum state can be steered along the designed MPC trajectory while maintaining physical realizability and stability. The thesis further develops a stochastic MPC (SMPC) formulation based on quantum filtering equations, describing the conditional evolution of quantum states under continuous observation. A theoretical equivalence between the proposed SMPC scheme and an optimal control problem is established, providing a tractable computational approach for feedback design in quantum stochastic systems. Finally, to address the limitations imposed by explicit identification of quantum systems in complex quantum systems, a data-driven MPC framework is introduced. Using locally observable dynamics and trajectory data, a data-driven MPC formulation is introduced to realize predictive quantum control without explicit system identification. This framework lays the foundation for measurement-aware and physically consistent quantum MPC.
Model predictive control has shown potential to enhance the robustness of quantum control systems. In this work, we propose a tractable Stochastic Model Predictive Control (SMPC) framework for finite-dimensional quantum systems under continuous-time measurement and quantum filtering. Using the almost-sure eigenstate reduction of quantum trajectories, we prove that the infinite-horizon stochastic objective collapses to a fidelity term that is computable in closed form from the one-step averaged state. Consequently, the online SMPC step requires only deterministic propagation of the filter and a terminal fidelity evaluation. An advantage of this method is that it eliminates per-horizon Monte Carlo scenario sampling and significantly reduces computational load while retaining the essential stochastic dynamics. We establish equivalence and mean-square stability guarantees, and validate the approach on multi-level and Ising-type systems, demonstrating favorable scalability compared to sampling-based SMPC.
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.