Dressing the chopped-random-basis optimization: a bandwidth-limited access to the trap-free landscape
Niklas Rach, Matthias M. M\"uller, Tommaso Calarco, Simone Montangero

TL;DR
This paper extends the understanding of control landscapes in quantum optimal control, demonstrating that bandwidth limitations do not introduce false traps and proposing a modified CRAB algorithm that efficiently finds optimal solutions within bandwidth constraints.
Contribution
It proves that bandwidth-limited controls can avoid false traps and introduces a modified CRAB algorithm that exploits this property for optimal quantum control.
Findings
Bandwidth constraints do not create false traps in control landscapes.
The modified CRAB algorithm effectively finds optimal controls within bandwidth limits.
The approach saturates the minimal bandwidth required for optimal control.
Abstract
In quantum optimal control theory the success of an optimization algorithm is highly influenced by how the figure of merit to be optimized behaves as a function of the control field, i.e. by the control landscape. Constraints on the control field introduce local minima in the landscape --false traps-- which might prevent an efficient solution of the optimal control problem. Rabitz et al. [Science 303, 1998 (2004)] showed that local minima occur only rarely for unconstrained optimization. Here, we extend this result to the case of bandwidth-limited control pulses showing that in this case one can eliminate the false traps arising from the constraint. Based on this theoretical understanding, we modify the Chopped Random Basis (CRAB) optimal control algorithm and show that this development exploits the advantages of both (unconstrained) gradient algorithms and of truncated basis methods,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
