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

Physical Review A

Monotonically convergent algorithms for solving quantum optimal control problems of a dynamical system nonlinearly interacting with a control

Yukiyoshi Ohtsuki, Kazuyuki Nakagami

Published Mar 18, 2008• 43 citations
Publisher

Abstract

We develop a family of monotonically convergent iterative algorithms for solving a wide class of optimal control problems in which a dynamical system interacts nonlinearly with a control. The key idea is to divide a control into identical components and to introduce auxiliary steps to update each component at every iteration step. The algorithms are proved to exhibit monotonic convergence, which is also numerically confirmed through a case study of the control of molecular orientation. The numerical results show that high-quality solutions can be obtained by using the present algorithms.

DOI
10.1103/physreva.77.033414

Related papers

Monotonically convergent optimal control theory of quantum systems under a nonlinear interaction with the control field

M. Lapert, Ronald Tehini, Gabriel Turinici +1 more

We consider the optimal control of quantum systems interacting nonlinearly with an electromagnetic field. We propose monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured by a nonstandard choice of the cost, which is not quadratic in the field. These algorithms can be constructed for pure- and mixed-state quantum systems. The efficiency of the method is shown numerically for molecular orientation with a nonlinearity of order 3 in the field. Discretizing the amplitude and the phase of the Fourier transform of the optimal field, we show that the optimal solution can be well approximated by pulses that could be implemented experimentally.

arXiv:0905.4867•Physical Review A•Aug 18, 2008•54 citations

Monotonically convergent algorithms for solving quantum optimal control problems described by an integrodifferential equation of motion

Yukiyoshi Ohtsuki, Yoshiaki Teranishi, Peter Saalfrank +2 more

A family of monotonically convergent algorithms is presented for solving a wide class of quantum optimal control problems satisfying an inhomogeneous integrodifferential equation of motion. The convergence behavior is examined using a four-level model system under the influence of non-Markovian relaxation. The results show that high quality solutions can be obtained over a wide range of parameters that characterize the algorithms, independent of the presence or absence of relaxation.

Physical Review A•Mar 19, 2007•32 citations

Monotonically convergent algorithms for locally constraint quantum controls

Gabriel Turinici

The problem of finding the optimal control in numerical computer simulations of quantum control phenomena is usually addressed through the introduction of monotonically convergent algorithms that are guaranteed to improve the cost functional at each step. A recent extension of these algorithms implements a search for a control with given bounds. Within this context, this paper will present a generalisation of this algorithm to a more general class of local in time constraints. Numerical results that illustrate some of the properties of the algorithms introduced are given. KEY WORDS quantum control, bilinear control, monotonic algorithms, numerical methods, non-linear control 1

•Feb 16, 2005•0 citations

Accelerated monotonic convergence of optimal control over quantum dynamics

Tak‐San Ho, HERSCHEL A. RABITZ

The control of quantum dynamics is often concerned with finding time-dependent optimal control fields that can take a system from an initial state to a final state to attain the desired value of an observable. This paper presents a general method for formulating monotonically convergent algorithms to iteratively improve control fields. The formulation is based on a two-point boundary-value quantum control paradigm (TBQCP) expressed as a nonlinear integral equation of the first kind arising from dynamical invariant tracking control. TBQCP is shown to be related to various existing techniques, including local control theory, the Krotov method, and optimal control theory. Several accelerated monotonic convergence schemes for iteratively computing control fields are derived based on TBQCP. Numerical simulations are compared with the Krotov method showing that the new TBQCP schemes are efficient and remain monotonically convergent over a wide range of the iteration step parameters and the control pulse lengths, which is attributable to the trap-free character of the transition probability quantum dynamics control landscape.

Physical Review E•Aug 12, 2010•44 citations

Monotonically convergent optimization in quantum control using Krotov's method

Daniel M. Reich, Mamadou Ndong, Christiane P. Koch

The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schrödinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the "standard" quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.

arXiv:1008.5126•The Journal of Chemical Physics•Mar 9, 2012•219 citations

A rapid monotonically convergent iteration algorithm for quantum optimal control over the expectation value of a positive definite operator

Wusheng Zhu, HERSCHEL A. RABITZ

A new iteration method is presented for achieving quantum optimal control over the expectation value of a positive definite operator. Theoretical analysis shows that this new algorithm exhibits quadratic and monotonic convergence. Numerical calculations verify that for this new algorithm, within a few steps, the optimized objective functional comes close to its converged limit.

The Journal of Chemical Physics•Jul 8, 1998•321 citations
We develop a family of monotonically convergent iterative algorithms for solving a wide class of optimal control problems in which a dynamical system interacts nonlinearly with a control. The key idea is to divide a control into identical components and to introduce auxiliary steps to update each component at every iteration step. The algorithms are proved to exhibit monotonic convergence, which is also numerically confirmed through a case study of the control of molecular orientation. The numerical results show that high-quality solutions can be obtained by using the present algorithms.
We consider the optimal control of quantum systems interacting nonlinearly with an electromagnetic field. We propose monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured by a nonstandard choice of the cost, which is not quadratic in the field. These algorithms can be constructed for pure- and mixed-state quantum systems. The efficiency of the method is shown numerically for molecular orientation with a nonlinearity of order 3 in the field. Discretizing the amplitude and the phase of the Fourier transform of the optimal field, we show that the optimal solution can be well approximated by pulses that could be implemented experimentally.
The problem of finding the optimal control in numerical computer simulations of quantum control phenomena is usually addressed through the introduction of monotonically convergent algorithms that are guaranteed to improve the cost functional at each step. A recent extension of these algorithms implements a search for a control with given bounds. Within this context, this paper will present a generalisation of this algorithm to a more general class of local in time constraints. Numerical results that illustrate some of the properties of the algorithms introduced are given. KEY WORDS quantum control, bilinear control, monotonic algorithms, numerical methods, non-linear control 1
The control of quantum dynamics is often concerned with finding time-dependent optimal control fields that can take a system from an initial state to a final state to attain the desired value of an observable. This paper presents a general method for formulating monotonically convergent algorithms to iteratively improve control fields. The formulation is based on a two-point boundary-value quantum control paradigm (TBQCP) expressed as a nonlinear integral equation of the first kind arising from dynamical invariant tracking control. TBQCP is shown to be related to various existing techniques, including local control theory, the Krotov method, and optimal control theory. Several accelerated monotonic convergence schemes for iteratively computing control fields are derived based on TBQCP. Numerical simulations are compared with the Krotov method showing that the new TBQCP schemes are efficient and remain monotonically convergent over a wide range of the iteration step parameters and the control pulse lengths, which is attributable to the trap-free character of the transition probability quantum dynamics control landscape.
The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schrödinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the "standard" quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.