Gradient-based algorithms are often applied to identify an optimal control for maximizing a quantum objective functional by following a steepest ascent path to the top of the control landscape. In contrast, this paper explores straight shots through control space where movement along such a path corresponds to a less demanding monotonic complete climb up the landscape for the optimal objective value. Existing studies of control landscapes have revealed the presence of straight shots, but identifying them required computationally intensive stochastic methods. In this paper, we introduce a non-stochastic straight-shot search algorithm (STSA) that identifies a large class of straight shots. We apply STSA to numerically generate more than 10,000 distinct straight-shot optimization paths and analyze their statistical distribution for each of the objectives of (i) state-to-state transitions, (ii) general observables, and (iii) unitary transformation generation. The results show a decrease in the nearest-neighbor distances among straight shots as the sample size increases, suggesting their prevalence in control space. We further conjecture that the starting locations of the straight-shot pathways on a landscape level set may form connected neighborhoods, motivating future investigation into their underlying topological structure. The present paper focuses on the use of STSA for locating massive numbers of straight solutions. However, the STSA is not a high-efficiency algorithm in its present form, but the discovered prevalence of control straight shots leaves open future advances to accelerate the discovery of straight shots as optimal controls.
Gradient-based algorithms are often applied to identify an optimal control for maximizing a quantum objective functional by following a steepest ascent path to the top of the control landscape. In contrast, this paper explores straight shots through control space where movement along such a path corresponds to a less demanding monotonic complete climb up the landscape for the optimal objective value. Existing studies of control landscapes have revealed the presence of straight shots, but identifying them required computationally intensive stochastic methods. In this paper, we introduce a non-stochastic straight-shot search algorithm (STSA) that identifies a large class of straight shots. We apply STSA to numerically generate more than 10,000 distinct straight-shot optimization paths and analyze their statistical distribution for each of the objectives of (i) state-to-state transitions, (ii) general observables, and (iii) unitary transformation generation. The results show a decrease in the nearest-neighbor distances among straight shots as the sample size increases, suggesting their prevalence in control space. We further conjecture that the starting locations of the straight-shot pathways on a landscape level set may form connected neighborhoods, motivating future investigation into their underlying topological structure. The present paper focuses on the use of STSA for locating massive numbers of straight solutions. However, the STSA is not a high-efficiency algorithm in its present form, but the discovered prevalence of control straight shots leaves open future advances to accelerate the discovery of straight shots as optimal controls.
A common goal of quantum control is to maximize a physical observable through the application of a tailored field. The observable value as a function of the field constitutes a quantum-control landscape. Previous papers have shown, under specified conditions, that the quantum-control landscape should be free of suboptimal critical points. This favorable landscape topology is one factor contributing to the efficiency of climbing the landscape. An additional complementary factor is the landscape structure, which constitutes all nontopological features. If the landscape's structure is too complex, then climbs may be forced to take inefficient convoluted routes to find optimal controls. This paper provides a foundation for understanding control-landscape structure by examining the linearity of gradient-based optimization trajectories through the space of control fields. For this assessment, a metric $R\ensuremath{\ge}1$ is defined as the ratio of the path length of the optimization trajectory to the Euclidean distance between the initial control field and the resultant optimal control field that takes an observable from the bottom to the top of the landscape. Computational analyses for simple model quantum systems are performed to ascertain the relative abundance of nearly straight control trajectories encountered when optimizing a state-to-state transition probability. The distribution of R values is found to be centered near remarkably low values upon sampling large numbers of randomly chosen initial control fields. Additionally, a stochastic algorithm is used to locate many distinct initial control fields, each of which corresponds to the start of an almost straight control trajectory with $R\ensuremath{\simeq}1.0$. The collected results indicate that quantum-control landscapes have very simple structural features. The favorable topology and the complementary simple structure of the control landscape provide a basis for understanding the generally observed ease of optimizing a state-to-state transition probability.
The dynamics of closed quantum systems may be manipulated by using an applied field to achieve a control objective value for a physical goal. The functional relationship between the applied field and the objective value forms a quantum control landscape, and the optimization process consists of a guided climb up the landscape from the bottom to the top. Two classes of landscape features are important for understanding the ease of finding an optimal control field. The first class of topological landscape features has been proven to be especially simple in that no suboptimal local maxima exist (upon satisfaction of certain assumptions), which partially accounts for the ease of finding optimal fields. Complementary to the topology, the second class of features entails the landscape structure, characterizing the sinuous nature of the paths leading to an optimal control field. Previous work found that the landscape structure is also particularly simple, as excursions up the landscape guided by a gradient algorithm correspond to nearly straight paths through the space of control fields. In this paper we take an alternative approach to examining landscape structure by constructing, and then following, exactly straight trajectories in control space. Each trajectory starts at a corresponding point on the bottom of the landscape and ends at an associated point on the top, with the observable values taken either as the state-to-state transition probability, the expectation value of a general observable, or the distance from a desired unitary transformation. In some cases the starting point is at a suboptimal critical-point saddle, with the goal, again, of following a straight field path to the optimal objective yield or another suboptimal critical point. We find that the objective value almost always rises monotonically upon following a straight control path from one critical point to another, which shows that landscape structure is very simple, being devoid of rough bumps and gnarled ``twists and turns''. An analysis reveals that the generally featureless nature of quantum control landscapes can be understood in terms of the occurrence of many interfering quantum pathways contributing while traversing the landscape, essentially smoothing out the terrain. These results also provide a basis for further studies to seek a new efficient algorithm to discover optimal fields by means of taking into account the inherently smooth landscape structure.
The control of quantum system dynamics is generally performed by seeking a suitable applied field. The physical objective as a functional of the field forms the quantum control landscape, whose topology, under certain conditions, has been shown to contain no critical point suboptimal traps, thereby enabling effective searches for fields that give the global maximum of the objective. This paper addresses the structure of the landscape as a complement to topological critical point features. Recent work showed that landscape structure is highly favorable for optimization of state-to-state transition probabilities, in that gradient-based control trajectories to the global maximum value are nearly straight paths. The landscape structure is codified in the metric R ≥ 1.0, defined as the ratio of the length of the control trajectory to the Euclidean distance between the initial and optimal controls. A value of R = 1 would indicate an exactly straight trajectory to the optimal observable value. This paper extends the state-to-state transition probability results to the quantum ensemble and unitary transformation control landscapes. Again, nearly straight trajectories predominate, and we demonstrate that R can take values approaching 1.0 with high precision. However, the interplay of optimization trajectories with critical saddle submanifolds is found to influence landscape structure. A fundamental relationship necessary for perfectly straight gradient-based control trajectories is derived, wherein the gradient on the quantum control landscape must be an eigenfunction of the Hessian. This relation is an indicator of landscape structure and may provide a means to identify physical conditions when control trajectories can achieve perfect linearity. The collective favorable landscape topology and structure provide a foundation to understand why optimal quantum control can be readily achieved.
The control of quantum systems has been proven to possess trap-free optimization landscapes under the satisfaction of proper assumptions. However, many details of the landscape geometry and their influence on search efficiency still need to be fully understood. This paper numerically explores the path-connectedness of globally optimal control solutions forming the top manifold of the landscape. We randomly sample a plurality of optimal controls in the top manifold to assess the existence of a continuous path at the top of the landscape that connects two arbitrary optimal solutions. It is shown that for different quantum control objectives including state-to-state transition probabilities, observable expectation values and unitary transformations, such a continuous path can be readily found, implying that these top manifolds are fundamentally path-connected. The significance of the latter conjecture lies in seeking locations in the top manifold where an ancillary objective can also be optimized while maintaining the full optimality of the original objective that defined the landscape.
The broad success of theoretical and experimental quantum optimal control is intimately connected to the topology of the underlying control landscape. For several common quantum control goals, including the maximization of an observable expectation value, the landscape has been shown to lack local optima if three assumptions are satisfied: (i) the quantum system is controllable, (ii) the Jacobian of the map from the control field to the evolution operator is full rank, and (iii) the control field is not constrained. In the case of the observable objective, this favorable analysis shows that the associated landscape also contains saddles, i.e., critical points that are not local suboptimal extrema. In this paper, we investigate whether the presence of these saddles affects the trajectories of gradient-based searches for an optimal control. We show through simulations that both the detailed topology of the control landscape and the parameters of the system Hamiltonian influence whether the searches are attracted to a saddle. For some circumstances with a special initial state and target observable, optimizations may approach a saddle very closely, reducing the efficiency of the gradient algorithm. Encounters with such attractive saddles are found to be quite rare. Neither the presence of a large number of saddles on the control landscape nor a large number of system states increases the likelihood that a search will closely approach a saddle. Even for applications that encounter a saddle, well-designed gradient searches with carefully chosen algorithmic parameters will readily locate optimal controls.
The exploration of a quantum control landscape, which is the physical observable as a function of the control variables, is fundamental for understanding the ability to perform observable optimization in the laboratory. For high control variable dimensions, trajectory-based methods provide a means for performing such systematic explorations by exploiting the measured gradient of the observable with respect to the control variables. This paper presents a practical, robust, easily implemented statistical method for obtaining the gradient on a general quantum control landscape in the presence of noise. In order to demonstrate the method's utility, the experimentally measured gradient is utilized as input in steepest-ascent trajectories on the landscapes of three model quantum control problems: spectrally filtered and integrated second harmonic generation as well as excitation of atomic rubidium. The gradient algorithm achieves efficiency gains of up to approximately three times that of the standard genetic algorithm and, as such, is a promising tool for meeting quantum control optimization goals as well as landscape analyses. The landscape trajectories directed by the gradient should aid in the continued investigation and understanding of controlled quantum phenomena.