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:0805.4026 · Physical Review A

Quantum Pareto optimal control

Raj Chakrabarti, Re-Bing Wu, HERSCHEL A. RABITZ

Published Sep 15, 2008• 31 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.78.033414

Related papers

Quantum multiobservable control

Raj Chakrabarti, Re-Bing Wu, HERSCHEL A. RABITZ

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.

arXiv:0805.1556•Physical Review A•Jun 30, 2008•22 citations

Pareto-front shape in multiobservable quantum control

Qiuyang Sun, Re-Bing Wu, HERSCHEL A. RABITZ

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.

Physical Review A•Mar 17, 2017•5 citations

Quantum algorithms for optimal control: large-scale finite-horizon linear-quadratic regulation

Xiajie Huang, Cristina Álvarez Yuste, Nikita Guseynov +2 more

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.

quant-pharXiv:2610.26843•Oct 20, 2026•1 citation

Quantum approximate multi-objective optimization

Ayse Kotil, Elijah Pelofske, Stephanie Riedmüller +4 more

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.

arXiv:2503.22797•Nature Computational Science•Oct 24, 2025•44 citations

Optimal state estimation of controllable quantum dynamical systems

Raj Chakrabarti, Anisha Ghosh

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.

Physical Review A•Mar 7, 2012•7 citations

Optimal control landscapes for quantum observables

HERSCHEL A. RABITZ, Michael Hsieh, Carey M. Rosenthal

The optimal control of quantum systems provides the means to achieve the best outcome from redirecting dynamical behavior. Quantum systems for optimal control are characterized by an evolving density matrix and a Hermitian operator associated with the observable of interest. The optimal control landscape is the observable as a functional of the control field. The features of interest over this control landscape consist of the extremum values and their topological character. For controllable finite dimensional quantum systems with no constraints placed on the controls, it is shown that there is only a finite number of distinct values for the extrema, dependent on the spectral degeneracy of the initial and target density matrices. The consequences of these findings for the practical discovery of effective quantum controls in the laboratory is discussed.

The Journal of Chemical Physics•May 25, 2006•52 citations
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.
The optimal control of quantum systems provides the means to achieve the best outcome from redirecting dynamical behavior. Quantum systems for optimal control are characterized by an evolving density matrix and a Hermitian operator associated with the observable of interest. The optimal control landscape is the observable as a functional of the control field. The features of interest over this control landscape consist of the extremum values and their topological character. For controllable finite dimensional quantum systems with no constraints placed on the controls, it is shown that there is only a finite number of distinct values for the extrema, dependent on the spectral degeneracy of the initial and target density matrices. The consequences of these findings for the practical discovery of effective quantum controls in the laboratory is discussed.