We describe algorithms and experimental strategies for the Pareto optimal control problem of simultaneously driving an arbitrary number of quantum observable expectation values to their respective extrema. Conventional quantum optimal control strategies are less effective at sampling points on the Pareto frontier of multiobservable control landscapes than they are at locating optimal solutions to single observable control problems. The present algorithms facilitate multiobservable optimization by following direct paths to the Pareto front, and are capable of continuously tracing the front once it is found to explore families of viable solutions. The numerical and experimental methodologies introduced are also applicable to other problems that require the simultaneous control of large numbers of observables, such as quantum optimal mixed state preparation.
We describe algorithms and experimental strategies for the Pareto optimal control problem of simultaneously driving an arbitrary number of quantum observable expectation values to their respective extrema. Conventional quantum optimal control strategies are less effective at sampling points on the Pareto frontier of multiobservable control landscapes than they are at locating optimal solutions to single observable control problems. The present algorithms facilitate multiobservable optimization by following direct paths to the Pareto front, and are capable of continuously tracing the front once it is found to explore families of viable solutions. The numerical and experimental methodologies introduced are also applicable to other problems that require the simultaneous control of large numbers of observables, such as quantum optimal mixed state preparation.
We present deterministic algorithms for the simultaneous control of an arbitrary number of quantum observables. Unlike optimal control approaches based on cost function optimization, quantum multiobservable tracking control (MOTC) is capable of tracking predetermined homotopic trajectories to target expectation values in the space of multiobservables. The convergence of these algorithms is facilitated by the favorable critical topology of quantum control landscapes. Fundamental properties of quantum multiobservable control landscapes, including the MOTC Gramian matrix, are introduced. The effects of multiple control objectives on the structure and complexity of optimal fields are examined. With minor modifications, the techniques described herein can be applied to general quantum multiobjective control problems.
Many scenarios in the sciences and engineering require simultaneous optimization of multiple objective functions, which are usually conflicting or competing. In such problems the Pareto front, where none of the individual objectives can be further improved without degrading some others, shows the tradeoff relations between the competing objectives. This paper analyzes the Pareto-front shape for the problem of quantum multiobservable control, i.e., optimizing the expectation values of multiple observables in the same quantum system. Analytic and numerical results demonstrate that with two commuting observables the Pareto front is a convex polygon consisting of flat segments only, while with noncommuting observables the Pareto front includes convexly curved segments. We also assess the capability of a weighted-sum method to continuously capture the points along the Pareto front. Illustrative examples with realistic physical conditions are presented, including NMR control experiments on a $^{1}\mathrm{H}\ensuremath{-}^{13}\mathrm{C}$ two-spin system with two commuting or noncommuting observables.
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 goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches. This study explores the use of quantum computing to address multi-objective optimization challenges. By using a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of multi-objective weighted max-cut problems, the authors demonstrate promising results—both in simulation and on IBM Quantum hardware—surpassing classical approaches.
We present system-theoretic quantum state reconstruction methods that minimize estimation error by combining optimal quantum control with asymptotically efficient estimation. Introducing the notion of optimal observability of a quantum dynamical system---a concept that does not exist in classical control theory---we formulate and solve the Pareto optimal control problem of maximizing state estimation accuracy while minimizing the expenditure of available control and measurement resources. Necessary and sufficient conditions for optimal observability, based on the quantum optimal observability Gramian, are presented. We examine the finite sample efficiency of the estimation methodology for two- and three-level systems using ideal and noisy control fields, and demonstrate the advantages of state reconstruction schemes based on optimal observability theory for experimentally realistic sample sizes. These results indicate that the optimal control of quantum measurement bases can be used to minimize state reconstruction errors by fully exploiting the information geometry of quantum states.
We investigate the problem of control of quantum systems. Various notions of controllability of quantum systems are discussed and Lie algebraic techniques are employed to derive necessary and sufficient conditions for the resulting degrees of controllability. The results are employed to study the degree of controllability for various model systems. The problem of optimal control is formulated as a problem of maximisation of the expectation value of an observable of the system subject to dynamical constraints and costs. A class of iterative algorithms is discussed, and shown to converge to a solution of the Euler-Lagrange equations, which is a necessary condition for optimality of a solution. A numerical realisation of the algorithm is presented and potential implementation of the resulting control fields in the laboratory is discussed. The algorithm is applied to find optimal control fields for a variety of applications including selective and simultaneous excitation of individual quantum dots in a globally addressed ensemble, creation of superposition states, and selective excitation of certain vibrational modes of a simple molecule such as Hydrogen Fluoride. In each case we systematically explore the parameter space of the algorithm to select solutions with desirable physical features from the multitude of possible choices. As there are many possible optimal control fields which give similar yields the question of whether some are more robust than others is investigated. A number of optimal fields are analysed quantitatively in terms of robustness with regard to temporal and spectral noise affecting the fields, uncertainty in the model parameters and the effect of experimental limitations such as restrictions on the bandwidth of the fields. It is shown that whilst the solutions tend to be sensitive to uncertainty in the energy levels chosen for the model, they appear to be surprisingly tolerant to even severe bandwidth limitations.