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

Numerical Functional Analysis and Optimization

Quantum Optimal Control Problems with a Sparsity Cost Functional

Gabriele Ciaramella, Alfio Borzì

Published May 9, 2016• 13 citations
Publisher

Abstract

In this article, the investigation of a class of quantum optimal control problems with L1 sparsity cost functionals is presented. The focus is on quantum systems modeled by Schrödinger-type equations with a bilinear control structure as it appears in many applications in nuclear magnetic resonance spectroscopy, quantum imaging, quantum computing, and in chemical and photochemical processes. In these problems, the choice of L1 control spaces promotes sparse optimal control functions that are conveniently produced by laboratory pulse shapers. The characterization of L1 quantum optimal controls and an efficient numerical semi-smooth Newton solution procedure are discussed.

DOI
10.1080/01630563.2016.1184166

Related papers

Optimal pulse design in quantum control: A unified computational method

Jr-Shin Li, Justin Ruths, Tsyr‐Yan Yu +2 more

Many key aspects of control of quantum systems involve manipulating a large quantum ensemble exhibiting variation in the value of parameters characterizing the system dynamics. Developing electromagnetic pulses to produce a desired evolution in the presence of such variation is a fundamental and challenging problem in this research area. We present such robust pulse designs as an optimal control problem of a continuum of bilinear systems with a common control function. We map this control problem of infinite dimension to a problem of polynomial approximation employing tools from geometric control theory. We then adopt this new notion and develop a unified computational method for optimal pulse design using ideas from pseudospectral approximations, by which a continuous-time optimal control problem of pulse design can be discretized to a constrained optimization problem with spectral accuracy. Furthermore, this is a highly flexible and efficient numerical method that requires low order of discretization and yields inherently smooth solutions. We demonstrate this method by designing effective broadband π/2 and π pulses with reduced rf energy and pulse duration, which show significant sensitivity enhancement at the edge of the spectrum over conventional pulses in 1D and 2D NMR spectroscopy experiments.

Proceedings of the National Academy of Sciences•Jan 18, 2011•131 citations

Computational techniques for optimal control of quantum systems

Evangelos A. Coutsias, G. von Winckel

The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.

•Jan 1, 2011•0 citations

Quantum Control With Piecewise Constant Control Functions

Ilan Degani, Antonella Zanna, L. Sælen +1 more

One of the long-standing problems in the field of computational quantum control is to devise algorithms that converge to high yield controls with a desired structure; particularly, controls that can be reproduced by laboratory laser pulse shapers. In this paper we propose an approach that is a considerable step forward toward the solution of this problem. Our treatment employs piecewise constant controls. For these, the concept of “desired structure” is addressed by including appropriate quadratic forms in the performance functionals. Thereafter, correct extremal control equations are derived, whereas the equations appearing in the literature are correct only to first or second order. We illustrate numerically that our approach can give extremely high yield controls with a desired structure. Our results are valid not only in the context of quantum control, but also for similiar bilinear systems arising in different areas. In particular, they are suitable for controlling linear flows with drift on unitary matrix groups.

SIAM Journal on Scientific Computing•Jan 1, 2009•17 citations

Algebraic and computational aspects of quantum control and applications.

I. C. H. Pullen

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.

•Jan 1, 2006•0 citations

Optimal control of two-level quantum systems

Domenico D’Alessandro, M. Dahleh

We study the manipulation of two-level quantum systems. This research is motivated by the design of quantum mechanical logic gates which perform prescribed logic operations on a two-level quantum system, a quantum bit. We consider the problem of driving the evolution operator to a desired state, while minimizing the energy-type cost. Mathematically, this problem translates into an optimal control problem for systems varying on the Lie group of special unitary matrices, with cost that is quadratic in the control. We develop a comprehensive theory of optimal control for two-level quantum systems. In particular, we prove the 'normality' of the given problem and the 'regularity' of the optimal control functions. The impact of the results of the paper on nuclear magnetic resonance experiments and quantum computation is discussed.

Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•Jan 1, 2000•33 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
In this article, the investigation of a class of quantum optimal control problems with L1 sparsity cost functionals is presented. The focus is on quantum systems modeled by Schrödinger-type equations with a bilinear control structure as it appears in many applications in nuclear magnetic resonance spectroscopy, quantum imaging, quantum computing, and in chemical and photochemical processes. In these problems, the choice of L1 control spaces promotes sparse optimal control functions that are conveniently produced by laboratory pulse shapers. The characterization of L1 quantum optimal controls and an efficient numerical semi-smooth Newton solution procedure are discussed.
Many key aspects of control of quantum systems involve manipulating a large quantum ensemble exhibiting variation in the value of parameters characterizing the system dynamics. Developing electromagnetic pulses to produce a desired evolution in the presence of such variation is a fundamental and challenging problem in this research area. We present such robust pulse designs as an optimal control problem of a continuum of bilinear systems with a common control function. We map this control problem of infinite dimension to a problem of polynomial approximation employing tools from geometric control theory. We then adopt this new notion and develop a unified computational method for optimal pulse design using ideas from pseudospectral approximations, by which a continuous-time optimal control problem of pulse design can be discretized to a constrained optimization problem with spectral accuracy. Furthermore, this is a highly flexible and efficient numerical method that requires low order of discretization and yields inherently smooth solutions. We demonstrate this method by designing effective broadband π/2 and π pulses with reduced rf energy and pulse duration, which show significant sensitivity enhancement at the edge of the spectrum over conventional pulses in 1D and 2D NMR spectroscopy experiments.
The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.
One of the long-standing problems in the field of computational quantum control is to devise algorithms that converge to high yield controls with a desired structure; particularly, controls that can be reproduced by laboratory laser pulse shapers. In this paper we propose an approach that is a considerable step forward toward the solution of this problem. Our treatment employs piecewise constant controls. For these, the concept of “desired structure” is addressed by including appropriate quadratic forms in the performance functionals. Thereafter, correct extremal control equations are derived, whereas the equations appearing in the literature are correct only to first or second order. We illustrate numerically that our approach can give extremely high yield controls with a desired structure. Our results are valid not only in the context of quantum control, but also for similiar bilinear systems arising in different areas. In particular, they are suitable for controlling linear flows with drift on unitary matrix groups.
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.
We study the manipulation of two-level quantum systems. This research is motivated by the design of quantum mechanical logic gates which perform prescribed logic operations on a two-level quantum system, a quantum bit. We consider the problem of driving the evolution operator to a desired state, while minimizing the energy-type cost. Mathematically, this problem translates into an optimal control problem for systems varying on the Lie group of special unitary matrices, with cost that is quadratic in the control. We develop a comprehensive theory of optimal control for two-level quantum systems. In particular, we prove the 'normality' of the given problem and the 'regularity' of the optimal control functions. The impact of the results of the paper on nuclear magnetic resonance experiments and quantum computation is discussed.
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.