Herschel Rabitz

Daoyi Dong, Ian R. Petersen, Herschel Rabitz

This paper presents a sampled-data approach for the robust control of a single qubit (quantum bit). The required robustness is defined using a sliding mode domain and the control law is designed offline and then utilized online with a single qubit having bounded uncertainties. Two classes of uncertainties are considered involving the system Hamiltonian and the coupling strength of the system-environment interaction. Four cases are analyzed in detail including without decoherence, with amplitude damping decoherence, phase damping decoherence and depolarizing decoherence. Sampling periods are specifically designed for these cases to guarantee the required robustness. Two sufficient conditions are presented for guiding the design of unitary control for the cases without decoherence and with amplitude damping decoherence. The proposed approach has potential applications in quantum error-correction and in constructing robust quantum gates.

Jason Dominy, Herschel Rabitz

We examine the topology of the subset of controls taking a given initial state to a given final state in quantum control, where "state" may mean a pure state |ψ>, an ensemble density matrix ρ, or a unitary propagator U(0,T). The analysis consists in showing that the endpoint map acting on control space is a Hurewicz fibration for a large class of affine control systems with vector controls. Exploiting the resulting fibration sequence and the long exact sequence of basepoint-preserving homotopy classes of maps, we show that the indicated subset of controls is homotopy equivalent to the loopspace of the state manifold. This not only allows us to understand the connectedness of "dynamical sets" realized as preimages of subsets of the state space through this endpoint map, but also provides a wealth of additional topological information about such subsets of control space.

Tak-San Ho, Herschel Rabitz, Gabriel Turinici

Numerical and experimental realizations of quantum control are closely connected to the properties of the mapping from the control to the unitary propagator. For bilinear quantum control problems, no general results are available to fully determine when this mapping is singular or not. In this paper we give suffcient conditions, in terms of elements of the evolution semigroup, for a trajectory to be non-singular. We identify two lists of "way-points" that, when reached, ensure the non-singularity of the control trajectory. It is found that under appropriate hypotheses one of those lists does not depend on the values of the coupling operator matrix.

Ofer M. Shir, Jonathan Roslund, Darrell Whitley et al.

The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) has been the most successful Evolution Strategy at exploiting covariance information; it uses a form of Principle Component Analysis which, under certain conditions, is suggested to converge to the correct covariance matrix, formulated as the inverse of the mathematically well-defined Hessian matrix. However, in practice, there exist conditions where CMA-ES converges to the global optimum (accomplishing its primary goal) while it does not learn the true covariance matrix (missing an auxiliary objective), likely due to step-size deficiency. These circumstances can involve high-dimensional landscapes with large condition numbers. This paper introduces a novel technique entitled Forced Optimal Covariance Adaptive Learning (FOCAL), with the explicit goal of determining the Hessian at the global basin of attraction. It begins by introducing theoretical foundations to the inverse relationship between the learned covariance and the Hessian matrices. FOCAL is then introduced and demonstrated to retrieve the Hessian matrix with high fidelity on both model landscapes and experimental Quantum Control systems, which are observed to possess a non-separable, non-quadratic search landscape. The recovered Hessian forms are corroborated by physical knowledge of the systems. This study constitutes an example for Natural Computing successfully serving other branches of natural sciences, and introducing at the same time a powerful generic method for any high-dimensional continuous search seeking landscape information.

Hailan Ma, Zhenhong Sun, Daoyi Dong et al.

Quantum state tomography (QST) is the process of reconstructing the state of a quantum system (mathematically described as a density matrix) through a series of different measurements, which can be solved by learning a parameterized function to translate experimentally measured statistics into physical density matrices. However, the specific structure of quantum measurements for characterizing a quantum state has been neglected in previous work. In this paper, we explore the similarity between highly structured sentences in natural language and intrinsically structured measurements in QST. To fully leverage the intrinsic quantum characteristics involved in QST, we design a quantum-aware transformer (QAT) model to capture the complex relationship between measured frequencies and density matrices. In particular, we query quantum operators in the architecture to facilitate informative representations of quantum data and integrate the Bures distance into the loss function to evaluate quantum state fidelity, thereby enabling the reconstruction of quantum states from measured data with high fidelity. Extensive simulations and experiments (on IBM quantum computers) demonstrate the superiority of the QAT in reconstructing quantum states with favorable robustness against experimental noise.

Ofer M. Shir, Xi Xing, Herschel Rabitz

This paper introduces a multi-level (m-lev) mechanism into Evolution Strategies (ESs) in order to address a class of global optimization problems that could benefit from fine discretization of their decision variables. Such problems arise in engineering and scientific applications, which possess a multi-resolution control nature, and thus may be formulated either by means of low-resolution variants (providing coarser approximations with presumably lower accuracy for the general problem) or by high-resolution controls. A particular scientific application concerns practical Quantum Control (QC) problems, whose targeted optimal controls may be discretized to increasingly higher resolution, which in turn carries the potential to obtain better control yields. However, state-of-the-art derivative-free optimization heuristics for high-resolution formulations nominally call for an impractically large number of objective function calls. Therefore, an effective algorithmic treatment for such problems is needed. We introduce a framework with an automated scheme to facilitate guided-search over increasingly finer levels of control resolution for the optimization problem, whose on-the-fly learned parameters require careful adaptation. We instantiate the proposed m-lev self-adaptive ES framework by two specific strategies, namely the classical elitist single-child (1+1)-ES and the non-elitist multi-child derandomized $(μ_W,λ)$-sep-CMA-ES. We first show that the approach is suitable by simulation-based optimization of QC systems which were heretofore viewed as too complex to address. We also present a laboratory proof-of-concept for the proposed approach on a basic experimental QC system objective.

Roberto Rey-de-Castro, Herschel Rabitz

We introduce a method for learning adversarial perturbations targeted to individual images or videos. The learned perturbations are found to be sparse while at the same time containing a high level of feature detail. Thus, the extracted perturbations allow a form of object or action recognition and provide insights into what features the studied deep neural network models consider important when reaching their classification decisions. From an adversarial point of view, the sparse perturbations successfully confused the models into misclassifying, although the perturbed samples still belonged to the same original class by visual examination. This is discussed in terms of a prospective data augmentation scheme. The sparse yet high-quality perturbations may also be leveraged for image or video compression.

Caleb Deen Bastian, Herschel Rabitz

Prediction and explanation are key objects in supervised machine learning, where predictive models are known as black boxes and explanatory models are known as glass boxes. Explanation provides the necessary and sufficient information to interpret the model output in terms of the model input. It includes assessments of model output dependence on important input variables and measures of input variable importance to model output. High dimensional model representation (HDMR), also known as the generalized functional ANOVA expansion, provides useful insight into the input-output behavior of supervised machine learning models. This article gives applications of HDMR in supervised machine learning. The first application is characterizing information leakage in ``big-data'' settings. The second application is reduced-order representation of elementary symmetric polynomials. The third application is analysis of variance with correlated variables. The last application is estimation of HDMR from kernel machine and decision tree black box representations. These results suggest HDMR to have broad utility within machine learning as a glass box representation.

Robert L. Kosut, Christian Arenz, Herschel Rabitz

The control landscape of a quantum system $A$ interacting with another quantum system $B$ is studied. Only system $A$ is accessible through time dependent controls, while system B is not accessible. The objective is to find controls that implement a desired unitary transformation on $A$, regardless of the evolution on $B$, at a sufficiently large final time. The freedom in the evolution on $B$ is used to define an \emph{extended control landscape} on which the critical points are investigated in terms of kinematic and dynamic gradients. A spectral decomposition of the corresponding extended unitary system simplifies the landscape analysis which provides: (i) a sufficient condition on the rank of the dynamic gradient of the extended landscape that guarantees a trap free search for the final time unitary matrix of system $A$, and (ii) a detailed decomposition of the components of the overall dynamic gradient matrix. Consequently, if the rank condition is satisfied, a gradient algorithm will find the controls that implements the target unitary on system $A$. It is shown that even if the dynamic gradient with respect to the controls alone is not full rank, the additional flexibility due to the parameters that define the extended landscape still can allow for the rank condition of the extended landscape to hold. Moreover, satisfaction of the latter rank condition subsumes any assumptions about controllability, reachability and control resources. Here satisfaction of the rank condition is taken as an assumption. The conditions which ensure that it holds remain an open research question. We lend some numerical support with two common examples for which the rank condition holds.

Daoyi Dong, Xi Xing, Hailan Ma et al.

Robust control design for quantum systems has been recognized as a key task in quantum information technology, molecular chemistry and atomic physics. In this paper, an improved differential evolution algorithm, referred to as \emph{msMS}\_DE, is proposed to search robust fields for various quantum control problems. In \emph{msMS}\_DE, multiple samples are used for fitness evaluation and a mixed strategy is employed for the mutation operation. In particular, the \emph{msMS}\_DE algorithm is applied to the control problems of (i) open inhomogeneous quantum ensembles and (ii) the consensus goal of a quantum network with uncertainties. Numerical results are presented to demonstrate the excellent performance of the improved machine learning algorithm for these two classes of quantum robust control problems. Furthermore, \emph{msMS}\_DE is experimentally implemented on femtosecond laser control applications to optimize two-photon absorption and control fragmentation of the molecule $\text{CH}_2\text{BrI}$. Experimental results demonstrate excellent performance of \emph{msMS}\_DE in searching for effective femtosecond laser pulses for various tasks.

Daoyi Dong, Mohamed A. Mabrok, Ian R. Petersen et al.

Robust control design for quantum systems has been recognized as a key task in the development of practical quantum technology. In this paper, we present a systematic numerical methodology of sampling-based learning control (SLC) for control design of quantum systems with uncertainties. The SLC method includes two steps of "training" and "testing". In the training step, an augmented system is constructed using artificial samples generated by sampling uncertainty parameters according to a given distribution. A gradient flow based learning algorithm is developed to find the control for the augmented system. In the process of testing, a number of additional samples are tested to evaluate the control performance where these samples are obtained through sampling the uncertainty parameters according to a possible distribution. The SLC method is applied to three significant examples of quantum robust control including state preparation in a three-level quantum system, robust entanglement generation in a two-qubit superconducting circuit and quantum entanglement control in a two-atom system interacting with a quantized field in a cavity. Numerical results demonstrate the effectiveness of the SLC approach even when uncertainties are quite large, and show its potential for robust control design of quantum systems.