Quantum control landscape theory was formulated to assess the ease of finding optimal control fields in simulations and in the laboratory. The landscape is the observable as a function of the controls, and a primary goal of the theory is the analysis of landscape features. In what is referred to as the kinematic picture of the landscape, prior work showed that the landscapes are generally free of traps that could halt the search for an optimal control at a suboptimal observable value. The present paper considers the dynamical picture of the landscape, seeking the existence of singular controls, especially of a nonkinematic nature along with an assessment of whether they correspond to traps. We analyze the necessary and sufficient conditions for singular controls to be kinematic or nonkinematic critical solutions and the likelihood of their being encountered while maximizing an observable. An algorithm is introduced to seek singular controls on the landscape in simulations along with an associated Hessian landscape analysis. Simulations are performed for a large number of model finite-level quantum systems, showing that all the numerically identified kinematic and nonkinematic singular critical controls are not traps, in support of the prior empirical observations on the ease of finding high-quality optimal control fields.
Compensation for parameter dispersion is a significant challenge for control of inhomogeneous quantum ensembles. In this paper, we present a systematic methodology of sampling-based learning control (SLC) for simultaneously steering the members of inhomogeneous quantum ensembles to the same desired state. The SLC method is employed for optimal control of the state-to-state transition probability for inhomogeneous quantum ensembles of spins as well as Λ type atomic systems. The procedure involves the steps of (i) training and (ii) testing. In the training step, a generalized system is constructed by sampling members according to the distribution of inhomogeneous parameters drawn from the ensemble. A gradient flow based learning and optimization algorithm is adopted to find the control for the generalized system. In the process of testing, a number of additional ensemble members are randomly selected to evaluate the control performance. Numerical results are presented showing the success of the SLC method.
Quantum optimal control has enjoyed wide success for a variety of theoretical and experimental objectives. These favorable results have been attributed to advantageous properties of the corresponding control landscapes, which are free from local optima if three conditions are met: (1) the quantum system is controllable, (2) the Jacobian of the map from the control field to the evolution operator is full rank, and (3) the control field is not constrained. This paper explores how gradient searches for globally optimal control fields are affected by deviations from assumption (2). In some quantum control problems, so-called singular critical points, at which the Jacobian is rank-deficient, may exist on the landscape. Using optimal control simulations, we show that search failure is only observed when a singular critical point is also a second-order trap, which occurs if the control problem meets additional conditions involving the system Hamiltonian and/or the control objective. All known second-order traps occur at constant control fields, and we also show that they only affect searches that originate very close to them. As a result, even when such traps exist on the control landscape, they are unlikely to affect well-designed gradient optimizations under realistic searching conditions.
In this paper, we consider the control system Σ defined by the rolling of a strictly convex surface S of IR 3 on a plane without slipping or spinning. The purpose of this paper is to present the numerical implementation of a constructive planning algorithm for Σ, which is based on a continuation method. The performances of that algorithm, both in robustness and convergence speed, are illustrated through several examples.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.