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

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.

💡 Research Summary

This paper introduces a new class of structure‑preserving integrators—commutator‑free Cayley (CF‑Cayley) methods—into the Krotov framework for quantum optimal control (QOC). The authors begin by formulating the standard QOC problem: a quantum system evolving under a (possibly nonlinear) Schrödinger equation is steered from an initial state to a target state by means of external control fields. The cost functional combines a fidelity term with a quadratic penalty on the control amplitudes. By applying Pontryagin’s Maximum Principle, the optimality conditions are expressed as a two‑point boundary‑value problem coupling forward propagation of the state ψ(t) with backward propagation of the adjoint λ(t) and a pointwise stationarity condition for the controls.

Krotov’s method solves this coupled system iteratively. Each iteration consists of (i) forward propagation of ψ using the current controls, (ii) backward propagation of λ using the same controls, and (iii) an analytical update of the controls that guarantees monotonic decrease of the cost functional. The overall efficiency of the algorithm is therefore dominated by the numerical integrator used for the forward and backward propagations. Conventional choices—high‑order Runge–Kutta, Magnus‑type exponential integrators, or Crank–Nicolson—either require costly matrix exponentials or nested commutators, and they may fail to preserve unitarity for long‑time or highly oscillatory dynamics.

To overcome these limitations, the authors develop CF‑Cayley schemes. The basic building block is the Cayley transform
(Cay(A)=\bigl(I+\tfrac12 A\bigr)^{-1}\bigl(I-\tfrac12 A\bigr)),
which is exactly unitary for skew‑Hermitian A and coincides with the Crank–Nicolson method (second‑order accuracy). By composing several Cayley transforms with appropriately chosen linear combinations of the time‑dependent generator (A(t)=-iH(t)), a fourth‑order, symmetric, commutator‑free propagator is obtained. The coefficients and quadrature nodes are those of a three‑stage Gauss–Legendre rule; the resulting scheme is denoted (U_{