A numerical method is presented for exploring the intertwined roles of the control-field structure and the final time T in determining the unitary evolution operator U ( T , 0) for finite-level quantum control systems. The algorithm can (a) identify controls achieving a target unitary operator W at time T up to machine precision and (b) identify a continuous family of controls producing the same operator W over a continuous interval of final times. The high degree of precision is obtained, in part, by exploiting the geometry of the unitary group. In particular, geodesics of the unitary group are followed, both for tracking to a target transformation and for error management.
A quantum control landscape is defined by the value of a physical observable as a functional of the time-dependent control field
E(t) for a given quantum-mechanical system. Level sets through this landscape are prescribed by a particular value of the target observable at the final dynamical time
T, regardless of the intervening dynamics. We present a technique for exploring a landscape level set, where a scalar variable
s is introduced to characterize trajectories along these level sets. The control fields
E(s,t) accomplishing this exploration (i.e., that produce the same value of the target observable for a given system) are determined by solving a differential equation over
s in conjunction with the time-dependent Schr\"odinger equation. There is full freedom to traverse a level set, and a particular trajectory is realized by making an a priori choice for a continuous function
f(s,t) that appears in the differential equation for the control field. The continuous function
f(s,t) can assume an arbitrary form, and thus a level set generally contains a family of controls, where each control takes the quantum system to the same final target value, but produces a distinct control mechanism. In addition, although the observable value remains invariant over the level set, other dynamical properties (e.g., the degree of robustness to control noise) are not specifically preserved and can vary greatly. Examples are presented to illustrate the continuous nature of level-set controls and their associated induced dynamical features, including continuously morphing mechanisms for population control in model quantum systems.
Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.
This work considers various families of quantum control landscapes (i.e. objective functions for optimal control) for obtaining target unitary transformations as the general solution of the controlled Schrödinger equation. We examine the critical point structure of the kinematic landscapes JF(U) = ||(U - W)A||2and JP(U) = ||A||4- |Tr(AA†W†U)|2defined on the unitary group U(H) of a finite-dimensional Hilbert space H. The parameter operator A E (H) is allowed to be completely arbitrary, yielding an objective function that measures the difference in the actions of U and the target W on a subspace of state space, namely the column space of A. The analysis of this function includes a description of the structure of the critical sets of these kinematic landscapes and characterization of the critical points as maxima, minima, and saddles. In addition, we consider the question of whether these landscapes are Morse-Bott functions on U(H). Landscapes based on the intrinsic (geodesic) distance on U(H) and the projective unitary group PU(H) are also considered. These results are then used to deduce properties of the critical set of the corresponding dynamical landscapes.
In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the internal Hamiltonian and the highest permitted control field amplitude. These findings reveal some properties of the reachable set of operations, explicitly analyzed for a single qubit. Moreover, for fully controllable systems, we identify a lower bound for the time at which all unitary gates become reachable. We use numerical gate optimization in order to study the tightness of the obtained bounds. It is shown that in the single qubit case our analytical findings describe the relationship between the highest control field amplitude and the minimum evolution time remarkably well. Finally, we discuss both challenges and ways forward for obtaining tighter bounds for higher dimensional systems, offering a discussion about the mathematical form and the physical meaning of the bound.
This paper presents a new tracking method where the target observable O(s,T) at the final dynamical time T follows a predefined track P(s) with respect to a homotopy tracking variable s>or=0. The procedure calculates the series of control fields E(s,t) required to accomplish observable homotopy tracking by solving a first-order differential equation in s for the evolution of the control field. Controls produced by this technique render the desired track for all s without encountering field singularities. This paper also extends the technique to the case where the field-free Hamiltonian and dipole moment operator change with s in order to explore the control of new physical systems along the track. Several simulations are presented illustrating the various uses for this quantum tracking control technique.
A controlled quantum system possesses a search landscape defined by the target physical objective as a function of the controls. This paper focuses on the landscape for the transition probability P(i → f) between the states of a finite level quantum system. Traditionally, the controls are applied fields; here, we extend the notion of control to also include the Hamiltonian structure, in the form of time independent matrix elements. Level sets of controls that produce the same transition probability value are shown to exist at the bottom P(i → f)=0.0 and top P(i → f)=1.0 of the landscape with the field and/or Hamiltonian structure as controls. We present an algorithm to continuously explore these level sets starting from an initial point residing at either extreme value of P(i → f). The technique can also identify control solutions that exhibit the desirable properties of (a) robustness at the top and (b) the ability to rapidly rise towards an optimal control from the bottom. Numerical simulations are presented to illustrate the varied control behavior at the top and bottom of the landscape for several simple model systems.