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:2603.11697

Cayley Commutator-free Methods for Krotov-Type Algorithms in Quantum Optimal Control

Boris Wembe, Usman Ali, T. Meier, Sina Ober‐Blöbaum

Published Mar 12, 2026• 1 citation
arXivHTMLPDF

Abstract

This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.

DOI
10.48550/arxiv.2603.11697

Related papers

Structure-preserving full- and low-rank exponential methods for the optimal control of Lindblad equations

Hao Chen, Alfio Borzì

Optimal control of open quantum systems governed by the Lindblad master equation requires the repeated solution of forward and adjoint evolution equations. For large Hilbert spaces, these computations demand numerical methods that are structure-preserving, accurate, and computationally efficient, while remaining compatible with nonsmooth optimization techniques. In this work, a unified framework for optimal control of Lindblad equations is presented. The continuous optimality system is derived from the Pontryagin maximum principle and solved by a sequential quadratic Hamiltonian (SQH) method. Its numerical realization is based on second-order exponential midpoint propagators for the forward and adjoint Lindblad equations with time-dependent Hamiltonians. Full-rank schemes preserving the Hermitian and positive-semidefinite structure of the density matrix are developed together with low-rank formulations that substantially reduce storage requirements and computational cost. Rigorous error estimates are established for the full- and low-rank forward and adjoint propagators. Numerical experiments confirm the predicted convergence rates, demonstrate the effectiveness of the low-rank approximations, and illustrate the performance of the proposed FREM-SQH and LREM-SQH algorithms for optimal control problems with smooth and nonsmooth control costs.

arXiv:2610.09403•Oct 7, 2026•0 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

Propagators for Quantum-Classical Models: Commutator-Free Magnus Methods

Adrián Gómez Pueyo, Sergio Blanes, Alberto Castro

We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.

Journal of Chemical Theory and Computation•Jan 30, 2020•6 citations

Structure-preserving quantum algorithms for linear and nonlinear Hamiltonian systems

Hsuan-Cheng Wu, Xiantao Li

Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is the underlying symplectic structure, which preserves geometric properties like phase-space volume over time and energy conservation over an extended period. In this paper, we present quantum algorithms that incorporate symplectic integrators, ensuring the preservation of this key structure. We demonstrate how these algorithms maintain the symplectic properties for both linear and nonlinear Hamiltonian systems. Additionally, we provide a comprehensive theoretical analysis of the computational complexity, showing that our approach offers both accuracy and improved efficiency over classical algorithms. These results highlight the potential application of quantum algorithms for solving large-scale Hamiltonian systems while preserving essential physical properties.

arXiv:2411.03599•Nov 6, 2024•6 citations

Fast, high precision dynamics in quantum optimal control theory

Mogens Dalgaard, Felix Motzoi

Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.

arXiv:2110.06187•Journal of Physics B Atomic Molecular and Optical Physics•Apr 2, 2022•15 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•46 citations
This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.
Optimal control of open quantum systems governed by the Lindblad master equation requires the repeated solution of forward and adjoint evolution equations. For large Hilbert spaces, these computations demand numerical methods that are structure-preserving, accurate, and computationally efficient, while remaining compatible with nonsmooth optimization techniques. In this work, a unified framework for optimal control of Lindblad equations is presented. The continuous optimality system is derived from the Pontryagin maximum principle and solved by a sequential quadratic Hamiltonian (SQH) method. Its numerical realization is based on second-order exponential midpoint propagators for the forward and adjoint Lindblad equations with time-dependent Hamiltonians. Full-rank schemes preserving the Hermitian and positive-semidefinite structure of the density matrix are developed together with low-rank formulations that substantially reduce storage requirements and computational cost. Rigorous error estimates are established for the full- and low-rank forward and adjoint propagators. Numerical experiments confirm the predicted convergence rates, demonstrate the effectiveness of the low-rank approximations, and illustrate the performance of the proposed FREM-SQH and LREM-SQH algorithms for optimal control problems with smooth and nonsmooth control costs.
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.
We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.
Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is the underlying symplectic structure, which preserves geometric properties like phase-space volume over time and energy conservation over an extended period. In this paper, we present quantum algorithms that incorporate symplectic integrators, ensuring the preservation of this key structure. We demonstrate how these algorithms maintain the symplectic properties for both linear and nonlinear Hamiltonian systems. Additionally, we provide a comprehensive theoretical analysis of the computational complexity, showing that our approach offers both accuracy and improved efficiency over classical algorithms. These results highlight the potential application of quantum algorithms for solving large-scale Hamiltonian systems while preserving essential physical properties.
Abstract Quantum optimal control theory is becoming increasingly crucial as quantum devices become more precise, but the need to quickly optimize these systems classically remains a significant bottleneck in their operation. Here we present a new theoretical quantum control framework for much faster optimization than the state of the art by replacing standard time propagation with a product of short-time propagators, each calculated using the Magnus expansion. The derived formulas for exact series terms and their gradients, based on earlier approximate integrals in a simulation setting, allow us to subsume the high cost of calculating commutators and integrals as an initial overhead. This provides an order of magnitude speedup for quantum control optimization.
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.