Papers › Monotonically convergent optimization in quantum control using Krotov's method

Monotonically convergent optimization in quantum control using Krotov's method

30 Aug 2010arXiv:1008.5126links table onlyarchive 2025-07-28

Daniel Reich, Mamadou Ndong, Christiane P. Koch

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The non-linear optimization method developed by Konnov and Krotov [Automation and Remote Control 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schr\"odinger equation [Sklarz and 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 non-linear equations of motion, control problems that are characterized by non-unitary time evolution, non-linear 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 non-linear (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.

PaperPDFCode

Code

qucontrol/krotov mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections