Quantum Multiobservable Control

We present deterministic algorithms for the simultaneous control of an arbitrary number of quantum observables. Unlike optimal control approaches based on cost function optimization, quantum multiobservable tracking control (MOTC) is capable of tracking predetermined homotopic trajectories to target expectation values in the space of multiobservables. The convergence of these algorithms is facilitated by the favorable critical topology of quantum control landscapes. Fundamental properties of quantum multiobservable control landscapes that underlie the efficiency of MOTC, including the multiobservable controllability Gramian, are introduced. The effects of multiple control objectives on the structure and complexity of optimal fields are examined. With minor modifications, the techniques described herein can be applied to general quantum multiobjective control problems.Comment: To appear in Physical Review

Optimal Control Theory for Continuous Variable Quantum Gates

We apply the methodology of optimal control theory to the problem of implementing quantum gates in continuous variable systems with quadratic Hamiltonians. We demonstrate that it is possible to define a fidelity measure for continuous variable (CV) gate optimization that is devoid of traps, such that the search for optimal control fields using local algorithms will not be hindered. The optimal control of several quantum computing gates, as well as that of algorithms composed of these primitives, is investigated using several typical physical models and compared for discrete and continuous quantum systems. Numerical simulations indicate that the optimization of generic CV quantum gates is inherently more expensive than that of generic discrete variable quantum gates, and that the exact-time controllability of CV systems plays an important role in determining the maximum achievable gate fidelity. The resulting optimal control fields typically display more complicated Fourier spectra that suggest a richer variety of possible control mechanisms. Moreover, the ability to control interactions between qunits is important for delimiting the total control fluence. The comparative ability of current experimental protocols to implement such time-dependent controls may help determine which physical incarnations of CV quantum information processing will be the easiest to implement with optimal fidelity.Comment: 39 pages, 11 figure

Volume Fractions of the Kinematic "Near-Critical" Sets of the Quantum Ensemble Control Landscape

An estimate is derived for the volume fraction of a subset $C_{\epsilon}^{P} = \{U : ||grad J(U)|\leq {\epsilon}\}\subset\mathrm{U}(N)$ in the neighborhood of the critical set $C^{P}\simeq\mathrm{U}(\mathbf{n})P\mathrm{U}(\mathbf{m})$ of the kinematic quantum ensemble control landscape J(U) = Tr(U\rho U' O), where $U$ represents the unitary time evolution operator, {\rho} is the initial density matrix of the ensemble, and O is an observable operator. This estimate is based on the Hilbert-Schmidt geometry for the unitary group and a first-order approximation of $||grad J(U)||^2$. An upper bound on these near-critical volumes is conjectured and supported by numerical simulation, leading to an asymptotic analysis as the dimension $N$ of the quantum system rises in which the volume fractions of these "near-critical" sets decrease to zero as $N$ increases. This result helps explain the apparent lack of influence exerted by the many saddles of $J$ over the gradient flow.Comment: 27 pages, 1 figur

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.Comment: 23 pages, 11 figure

Two-qubit gate operations in superconducting circuits with strong coupling and weak anharmonicity

We investigate theoretically the implementation of two-qubit gates in a system of two coupled superconducting qubits. In particular, we analyze two-qubit gate operations under the condition that the coupling strength is comparable to or even larger than the anharmonicity of the qubits. By numerically solving the time-dependent Schr\"odinger equation, we obtain the dependence of the two-qubit gate fidelity on the system parameters in the case of direct and indirect qubit-qubit coupling. Our numerical results can be used to identify the "safe" parameter regime for experimentally implementing two-qubit gates with high fidelity in these systems