We discuss quantum optimal control of Bose-Einstein condensates trapped in magnetic microtraps. The objective is to transfer a condensate from the ground state to the first-excited state. This type of control problem is typically solved using derivative-based methods in a high-dimensional control space such as gradient-ascent pulse engineering (GRAPE) and Krotov's method or derivative-free methods in a reduced control space such as Nelder-Mead with a chopped random basis (CRAB). We discuss how these methods can be combined in gradient optimization using parametrization (GROUP) including the finite bandwidth of the control electronics. We compare these methods and find that GROUP converges much faster than Nelder-Mead with CRAB and achieves better results than GRAPE and Krotov's method on the control problem presented here.
We discuss quantum optimal control of Bose-Einstein condensates trapped in magnetic microtraps. The objective is to transfer a condensate from the ground state to the first-excited state. This type of control problem is typically solved using derivative-based methods in a high-dimensional control space such as gradient-ascent pulse engineering (GRAPE) and Krotov's method or derivative-free methods in a reduced control space such as Nelder-Mead with a chopped random basis (CRAB). We discuss how these methods can be combined in gradient optimization using parametrization (GROUP) including the finite bandwidth of the control electronics. We compare these methods and find that GROUP converges much faster than Nelder-Mead with CRAB and achieves better results than GRAPE and Krotov's method on the control problem presented here.
We study optimal quantum control of the dynamics of trapped Bose-Einstein condensates: The targets are to split a condensate, residing initially in a single well, into a double well, without inducing excitation, and to excite a condensate from the ground state to the first-excited state of a single well. The condensate is described in the mean-field approximation of the Gross-Pitaevskii equation. We compare two optimization approaches in terms of their performance and ease of use; namely, gradient-ascent pulse engineering (GRAPE) and Krotov's method. Both approaches are derived from the variational principle but differ in the way the control is updated, additional costs are accounted for, and second-order-derivative information can be included. We find that GRAPE produces smoother control fields and works in a black-box manner, whereas Krotov with a suitably chosen step-size parameter converges faster but can produce sharp features in the control fields.
Abstract The mathematics of optimal control of quantum systems is of great interest in connection with fundamental problems of physics as well as with existing and prospective applications to quantum technologies. One important problem is the development of methods for constructing controls for quantum systems. One of the commonly used methods is the Krotov method, which was initially proposed outside of quantum control theory in articles by Krotov and Feldman (1978, 1983). This method was used to develop a novel approach to finding optimal controls for quantum systems in [64] (Tannor, Kazakov, and Orlov, 1992), [65] (Somlói, Kazakov, and Tannor, 1993), and in many other works by various scientists. Our survey discusses mathematical aspects of this method for optimal control of closed quantum systems. It outlines various modifications with different forms of the improvement function (for example, linear or linear-quadratic), different constraints on the control spectrum and on the admissible states of the quantum system, different regularisers, and so on. The survey describes applications of the Krotov method to controlling molecular dynamics and Bose–Einstein condensates, and to quantum gate generation. This method is compared with the GRAPE (GRadient Ascent Pulse Engineering) method, the CRAB (Chopped Random-Basis) method, and the Zhu–Rabitz and Maday–Turinici methods. Bibliography: 158 titles.
Mathematical problems of optimal control of quantum systems attract high interest in connection with both fundamental questions and existing and prospective applications. An important problem is the development of methods for constructing controls for quantum systems. One of the widely used methods is the Krotov method. The article is the first part of the review devoted to mathematical aspects of this method for optimal control of quantum systems. Beyond quantum control this method was suggested in the articles [V.F. Krotov, I.N. Feldman, Eng. Cybern. 1983. Vol. 21, 123], [A.I. Konnov, V.F. Krotov, Automat. Remote Control, 1999], and then adopted to optimal quantum control in papers by V.A. Kazakov, V.F. Krotov, R. Kosloff, C.P. Koch, D.J. Tannor, and others. The review considers this method, including cases with constraints on control spectrum and on states of the quantum system, various ways for choosing the improvement function, in particular, linear or linear-quadratic form, etc. We also discuss GRAPE (GRadient Ascent Pulse Engineering) and CRAB (Chopped Random-Basis) methods, as well as combined methods such as the method suggested by I. Maday and G. Turinici for generalizing the 1st order Krotov method and the Zhu-Rabitz method. Nowadays, various versions of the Krotov method are used as a key tool in optimal quantum control, and the review describes applications of this method to mathematical control problems for molecular dynamics, Bose-Einstein condensate, nuclear-magnetic resonance, quantum gates generation, etc. The first part of the review is devoted to closed quantum systems.
Applications of Bose-Einstein condensates (BEC) often require that the condensate be prepared in a specific complex state. Optimal control is a reliable framework to prepare such a state while avoiding undesirable excitations, and, when applied to the time-dependent Gross-Pitaevskii equation (GPE) model of BEC in multiple space dimensions, results in a large computational problem. We propose a control method based on first reducing the problem, using a Galerkin expansion, from a partial differential equation to a low-dimensional Hamiltonian ordinary differential equation system. We then apply a two-stage hybrid control strategy. At the first stage, we approximate the control using a second Galerkin-like method known as the chopped random basis to derive a finite-dimensional nonlinear programing problem, which we solve with a differential evolution algorithm. This search method then yields a candidate local minimum which we further refine using a variant of gradient descent. This hybrid strategy allows us to greatly reduce excitations both in the reduced model and the full GPE system.
In this work, we describe in detail the chopped random basis (CRAB) optimal control technique recently introduced to optimize time-dependent density matrix renormalization group simulations [P. Doria, T. Calarco, and S. Montangero, Phys. Rev. Lett. 106, 190501 (2011)]. Here, we study the efficiency of this control technique in optimizing different quantum processes and we show that in the considered cases we obtain results equivalent to those obtained via different optimal control methods while using less resources. We propose the CRAB optimization as a general and versatile optimal control technique.
Optimal control theory is a powerful tool for solving control problems in quantum mechanics, ranging from the control of chemical reactions to the implementation of gates in a quantum computer. Gradient-based optimization methods are able to find high fidelity controls, but require considerable numerical effort and often yield highly complex solutions. We propose here to employ a two-stage optimization scheme to significantly speed up convergence and achieve simpler controls. The control is initially parametrized using only a few free parameters, such that optimization in this pruned search space can be performed with a simplex method. The result, considered now simply as an arbitrary function on a time grid, is the starting point for further optimization with a gradient-based method that can quickly converge to high fidelities. We illustrate the success of this hybrid technique by optimizing a geometric phase gate for two superconducting transmon qubits coupled with a shared transmission line resonator, showing that a combination of Nelder-Mead simplex and Krotov’s method yields considerably better results than either one of the two methods alone.