arXiv subjects

Tak-San Ho

Publications and source records attributed to Tak-San Ho.

At least 19 recordsLinked to original sources

arXiv2025

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz [Phys. Rev. A 67, 033407 (2003)], we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

quant-ph↗

arXiv2024

The Top Manifold Connectedness of Quantum Control Landscapes

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.

quant-ph↗

arXiv2023

Quantum tracking control of the orientation of symmetric top molecules

The goal of quantum tracking control is to identify shaped fields to steer observable expectation values along designated time-dependent tracks. The fields are determined via an iteration-free procedure, which is based on inverting the underlying dynamical equations governing the controlled observables. In this article, we generalize the ideas in Phys. Rev. A 98, 043429 (2018) to the task of orienting symmetric top molecules in 3D. To this end, we derive equations for the control fields capable of directly tracking the expected value of the 3D dipole orientation vector along a desired path in time. We show this framework can be utilized for tracking the orientation of linear molecules as well, and present numerical illustrations of these principles for symmetric top tracking control problems.

quant-ph↗

arXiv2021

From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms

The last decade has witnessed remarkable progress in the development of quantum technologies. Although fault-tolerant devices likely remain years away, the noisy intermediate-scale quantum devices of today may be leveraged for other purposes. Leading candidates are variational quantum algorithms (VQAs), which have been developed for applications including chemistry, optimization, and machine learning, but whose implementations on quantum devices have yet to demonstrate improvements over classical capabilities. In this Perspective, we propose a variety of ways that the performance of VQAs could be informed by quantum optimal control theory. To set the stage, we identify VQAs and quantum optimal control as formulations of variational optimization at the circuit level and pulse level, respectively, where these represent just two levels in a broader hierarchy of abstractions that we consider. In this unified picture, we suggest several ways that the different levels of abstraction may be connected, in order to facilitate the application of quantum optimal control theory to VQA challenges associated with ansatz selection, optimization landscapes, noise, and robustness. A major theme throughout is the need for sufficient control resources in VQA implementations; we discuss different ways this need can manifest, outline a variety of open questions, and conclude with a look to the future.

quant-ph↗

arXiv2020

Quantum System Compression: A Hamiltonian Guided Walk Through Hilbert Space

We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert space dimension with the number of particles. For a \emph{constant} Hamiltonian system of Hilbert space dimension $n$ whose frequencies range from $f_{\min}$ to $f_{\max}$, we show via a proper orthogonal decomposition, that for a run-time $T$, the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the time-bandwidth product $\delf=(f_{\max}-f_{\min})T$. We also show how the distribution of initial states can further compress the system dimension. Under the stated conditions, the time-bandwidth estimate reveals the \emph{existence} of an effective compressed model whose dimension is derived solely from system properties and not dependent on the particular implementation of a variational simulator, such as a machine learning system, or quantum device. However, finding an efficient solution procedure \emph{is} dependent on the simulator implementation{\color{black}, which is not discussed in this paper}. In addition, we show that the compression rendered by the proper orthogonal decomposition encoding method can be further strengthened via a multi-layer autoencoder. Finally, we present numerical illustrations to affirm the compression behavior in time-varying Hamiltonian dynamics in the presence of external fields. We also discuss the potential implications of the findings for machine learning tools to efficiently solve the many-body or other high dimensional Schr{ö}dinger equations.

quant-ph↗

arXiv2018

Optimal control of interacting quantum systems based on the first-order Magnus approximation: Application to multiple dipole-dipole coupled molecular rotors

We develop a methodology for performing approximate optimal control simulations for quantum systems with multiple interacting degrees of freedom. The quantum dynamics are modeled using the first-order Magnus approximation in the interaction picture, where the interactions between different degrees of freedom are treated as the perturbation. We present a numerical procedure for implementing this approximation, which leverages the separability of the zeroth-order time evolution operator and the pairwise nature of common interactions for a reduced computational cost. This formulation of the first-order Magnus approximation is suitable to be combined with gradient-free methods for control field optimization; to this end, we adopt a Stochastic Hill Climbing algorithm. The associated computational costs are analyzed and compared with those of the exact simulation in the large N limit. For numerical illustrations, we perform approximate optimal control simulations for systems of two and three dipole-dipole coupled molecular rotors under the influence of a global control field. For the two rotor system, we optimize fields for both orientation and entanglement control objectives. For the three rotor system, we optimize fields for orienting rotors in the same direction as well as in opposite directions.

quant-ph↗

arXiv2018

Singularity-free quantum tracking control of molecular rotor orientation

Quantum tracking control aims to identify applied fields to steer the expectation values of particular observables along desired paths in time. The associated temporal fields can be identified by inverting the underlying dynamical equations for the observables. However, fields found in this manner are often plagued by undesirable singularities. In this paper we consider a planar molecular rotor, and derive singularity-free tracking expressions for the fields that steer the expectation of the orientation of the rotor along desired trajectories in time. Simulations are presented that utilize two orthogonal control electric fields to drive the orientation of the rotor along a series of designated tracks.

quant-ph↗

arXiv2016

Inherently trap-free convex landscapes for full quantum optimal control

We present a comprehensive analysis of the landscape for full quantum-quantum control associated with the expectation value of an arbitrary observable of one quantum system controlled by another quantum system. It is shown that such full quantum-quantum control landscapes are convex, and hence devoid of local suboptima and saddle points that may exist in landscapes for quantum systems controlled by time-dependent classical fields. There is no controllability requirement for the full quantum-quantum landscape to be trap-free, although the forms of Hamiltonians, the flexibility in choosing initial state of the controller, as well as the control duration, can infulence the reachable optimal value on the landscape. All level sets of the full quantum-quantum landscape are connected convex sets. Finally, we show that the optimal solution of the full quantum-quantum control landscape can be readily determined numerically, which is demonstrated using the Jaynes-Cummings model depicting a two-level atom interacting with a quantized radiation field.

quant-ph↗

arXiv2015

Searching for quantum optimal controls under severe constraints

The success of quantum optimal control for both experimental and theoretical objectives is connected to the topology of the corresponding control landscapes, which are free from local traps 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 of full rank, and (3) there are no constraints on the control field. This paper investigates how the violation of assumption (3) affects gradient searches for globally optimal control fields. The satisfaction of assumptions (1) and (2) ensures that the control landscape lacks fundamental traps, but certain control constraints can still introduce artificial traps. Proper management of these constraints is an issue of great practical importance for numerical simulations as well as optimization in the laboratory. Using optimal control simulations, we show that constraints on quantities such as the number of control variables, the control duration, and the field strength are potentially severe enough to prevent successful optimization of the objective. For each such constraint, we show that exceeding quantifiable limits can prevent gradient searches from reaching a globally optimal solution. These results demonstrate that careful choice of relevant control parameters helps to eliminate artificial traps and facilitate successful optimization.

quant-ph↗

arXiv2014

Characterization of control noise effects in optimal quantum unitary dynamics

This work develops measures for quantifying the effects of field noise upon targeted unitary transformations. Robustness to noise is assessed in the framework of the quantum control landscape, which is the mapping from the control to the unitary transformation performance measure (quantum gate fidelity). Within that framework, a new geometric interpretation of stochastic noise effects naturally arises, where more robust optimal controls are associated with regions of small overlap between landscape curvature and the noise correlation function. Numerical simulations of this overlap in the context of quantum information processing reveal distinct noise spectral regimes that better support robust control solutions. This perspective shows the dual importance of both noise statistics and the control form for robustness, thereby opening up new avenues of investigation on how to mitigate noise effects in quantum systems.

quant-ph↗

arXiv2014

Exploring the complexity of quantum control optimization trajectories

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\geq 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.

quant-ph↗

arXiv2014

Searching for quantum optimal controls in the presence of singular critical points

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.

quant-ph↗

arXiv2013

Characterization of the Critical Sets of Quantum Unitary Control Landscapes

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 J_F (U) = ||(U-W)A||^2 and J_P (U) = ||A||^4 - |Tr(AA'W'U)|^2 defined on the unitary group U(H) of a finite-dimensional Hilbert space H. The parameter operator A in B(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.

quant-ph↗

arXiv2013

Exploring Quantum Control Landscape Structure

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 works 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 \textit{structure}, which constitutes all non-topological features. If the landscape's structure is too complex, then climbs may be forced to take inefficient convoluted routes to finding 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\geq 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 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.

quant-ph↗

arXiv2013

Topology of Classical Molecular Optimal Control Landscapes in Phase Space

Optimal control of molecular dynamics is commonly expressed from a quantum mechanical perspective. However, in most contexts the preponderance of molecular dynamics studies utilize classical mechanical models. This paper treats laser-driven optimal control of molecular dynamics in a classical framework. We consider the objective of steering a molecular system from an initial point in phase space to a target point, subject to the dynamic constraint of Hamilton's equations. The classical control landscape corresponding to this objective is a functional of the control field, and the topology of the landscape is analyzed through its gradient and Hessian with respect to the control. Under specific assumptions on the regularity of the control fields, the classical control landscape is found to be free of traps that could hinder reaching the objective. The Hessian associated with an optimal control field is shown to have finite rank, indicating the presence of an inherent degree of robustness to control noise. Extensive numerical simulations are performed to illustrate the theoretical principles on a) a model diatomic molecule, b) two coupled Morse oscillators, and c) a chaotic system with a coupled quartic oscillator, confirming the absence of traps in the classical control landscape. We compare the classical formulation with the mathematically analogous state-to-state transition probability control landscape of N-level quantum systems. The absence of traps in both circumstances provides a broader basis to understand the growing number of successful control experiments with complex molecules, which can have dynamics that transcend the classical and quantum regimes.

physics.chem-ph↗

arXiv2012

Exploring the trade-off between fidelity- and time-optimal control of quantum unitary transformations

Generating a unitary transformation in the shortest possible time is of practical importance to quantum information processing because it helps to reduce decoherence effects and improve robustness to additive control field noise. Many analytical and numerical studies have identified the minimum time necessary to implement a variety of quantum gates on coupled-spin qubit systems. This work focuses on exploring the Pareto front that quantifies the trade-off between the competitive objectives of maximizing the gate fidelity $\mathcal{F}$ and minimizing the control time $T$. In order to identify the critical time $T^{\ast}$, below which the target transformation is not reachable, as well as to determine the associated Pareto front, we introduce a numerical method of Pareto front tracking (PFT). We consider closed two- and multi-qubit systems with constant inter-qubit coupling strengths and each individual qubit controlled by a separate time-dependent external field. Our analysis demonstrates that unit fidelity (to a desired numerical accuracy) can be achieved at any $T \geq T^{\ast}$ in most cases. However, the optimization search effort rises superexponentially as $T$ decreases and approaches $T^{\ast}$. Furthermore, a small decrease in control time incurs a significant penalty in fidelity for $T < T^{\ast}$, indicating that it is generally undesirable to operate below the critical time. We investigate the dependence of the critical time $T^{\ast}$ on the coupling strength between qubits and the target gate transformation. Practical consequences of these findings for laboratory implementation of quantum gates are discussed.

quant-ph↗

arXiv2012

Comment on "Are There Traps in Quantum Control Landscapes?"

Many quantum control problems are formulated as a search for an optimal field that maximizes a physical objective. This search is performed over a landscape defined as the objective as a function of the control field. A recent Letter [A. N. Pechen and D. J. Tannor, Phys. Rev. Lett. 106, 120402 (2011)] asserts that the existence of special landscape critical points (CPs) with trapping characteristics is "contrary to recent claims in the literature" and "can have profound implications for both theoretical and experimental quantum control studies." We show here that these assertions are inaccurate and misleading.

quant-ph↗

arXiv2012

Critical points of the optimal quantum control landscape: a propagator approach

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.

math.NA↗