Optimal control of quantum phenomena involves the introduction of a cost functional J to characterize the degree of achieving a physical objective by a chosen shaped electromagnetic field. The cost functional dependence upon the control forms a control landscape. Two theoretically important canonical cases are the landscapes associated with seeking to achieve either a physical observable or a unitary transformation. Upon satisfaction of particular assumptions, both landscapes are analytically known to be trap-free, yet possess saddle points at precise suboptimal J values. The presence of saddles on the landscapes can influence the effort needed to find an optimal field. As a foundation to future algorithm development and analyzes, we define metrics that identify the 'distance' from a given saddle based on the sufficient and necessary conditions for the existence of the saddles. Algorithms are introduced utilizing the metrics to find a control such that the dynamics arrive at a targeted saddle. The saddle distance metric and saddle-seeking methodology is tested numerically in several model systems.
Optimal control of quantum phenomena involves the introduction of a cost functional J to characterize the degree of achieving a physical objective by a chosen shaped electromagnetic field. The cost functional dependence upon the control forms a control landscape. Two theoretically important canonical cases are the landscapes associated with seeking to achieve either a physical observable or a unitary transformation. Upon satisfaction of particular assumptions, both landscapes are analytically known to be trap-free, yet possess saddle points at precise suboptimal J values. The presence of saddles on the landscapes can influence the effort needed to find an optimal field. As a foundation to future algorithm development and analyzes, we define metrics that identify the 'distance' from a given saddle based on the sufficient and necessary conditions for the existence of the saddles. Algorithms are introduced utilizing the metrics to find a control such that the dynamics arrive at a targeted saddle. The saddle distance metric and saddle-seeking methodology is tested numerically in several model systems.
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 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 growing successes in performing quantum control experiments motivated the development of control landscape analysis as a basis to explain these findings. When a quantum system is controlled by an electromagnetic field, the observable as a functional of the control field forms a landscape. Theoretical analyses have predicted the existence of critical points over the landscapes, including saddle points with indefinite Hessians. This paper presents a systematic experimental study of quantum control landscape saddle points. Nuclear magnetic resonance control experiments are performed on a coupled two-spin system in a 13C-labeled chloroform (13CHCl3) sample. We address the saddles with a combined theoretical and experimental approach, measure the Hessian at each identified saddle point, and study how their presence can influence the search effort utilizing a gradient algorithm to seek an optimal control outcome. The results have significance beyond spin systems, as landscape saddles are expected to be present for the control of broad classes of quantum systems.
The optimal creation of a targeted unitary transformation W is considered under the influence of an external control field. The controlled dynamics produces the unitary transformation U and the goal is to seek a control field that minimizes the cost $J=\ensuremath{\parallel}W\ensuremath{-}U\ensuremath{\parallel}$. The optimal control landscape is the cost J as a functional of the control field. For a controllable quantum system with N states and without restrictions placed on the controls, the optimal control landscape is shown to have extrema with N+1 possible distinct values, where the desired transformation at U=W is a minimum and the maximum value is at $U=\ensuremath{-}W$. The other distinct $N\ensuremath{-}1$ extrema values of J are saddle points. The results of this analysis have significance for the practical construction of unitary transformations.
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 dynamics is generally accomplished by seeking a tailored electromagnetic field to meet a posed objective. A particular shaped field can be thought of as specifying a point on a quantum control landscape, which is the objective as a functional of the controls. Optimizing the pulse shape corresponds to climbing the landscape, and previous work showed that the paths taken up the landscapes, guided by a gradient algorithm, are surprisingly straight when projected into the space of control fields. The direct nature of these control trajectories can be quantified by the metric $R\ensuremath{\ge}1$, defined as the ratio of the length of the control trajectory to the Euclidean distance between its end points. The prior observation of often finding low values of R implies that the landscapes are structurally simple. In this work, we investigate whether there is a relationship between the intricacy of the control mechanism and the complexity of the trajectory taken through the control space reflected in the value of R. We use the Hamiltonian encoding procedure to identify the mechanism, and we examine control of the state-to-state transition probability. No significant correlation is found between the landscape structure, reflected in the value of R, and the control mechanism. This result has algorithmic implications, opening up the prospect of seeking fields producing particular mechanisms at little penalty in the search effort due to encountering complex landscape structure.