We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.
We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.
We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity, we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric description of quantum adiabatic evolution and quantum phase transitions that generalizes previous treatments to allow for degeneracy. The same structure is relevant for applications in quantum information processing, including adiabatic and holonomic quantum computing, where geodesics over the manifold of control parameters correspond to paths which minimize errors. We illustrate this geometric structure with examples, for which we explicitly find adiabatic geodesics. By solving the geodesic equations in the vicinity of a quantum critical point, we identify universal characteristics of optimal adiabatic passage through a quantum phase transition. In particular, we show that in the vicinity of a critical point describing a second-order quantum phase transition, the geodesic exhibits power-law scaling with an exponent given by twice the inverse of the product of the spatial and scaling dimensions.
We investigate the optimization of quantum control from a differential geometric perspective. In our approach, optimal control minimizes the cost associated with evolving a quantum state, with the cost quantified by the length of the trajectory on a relevant Riemannian manifold. We demonstrate the optimization protocol in systems with SU(2) and SU(1,1) dynamical symmetries, which encompass a broad range of physical systems. In these systems, the time evolution can be represented by trajectories on a three-dimensional manifold. Given the initial and final states, the minimum-cost quantum control corresponds to a geodesic on the manifold. When the trajectory between the initial and final states is specified, the minimum-cost control corresponds to a geodesic within a submanifold embedded in the three-dimensional space. This framework provides a geometric method for optimizing shortcuts to adiabatic driving.
Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for a wide range of quantum control problems. So far, this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here we show that the quantum brachistochrone problem can be recast as that of finding geodesic paths in the space of unitary operators. We expect this brachistochrone-geodesic connection to have broad applications, as it opens up minimal-time control to the tools of geometry. As one such application, we use it to obtain a fast numerical method to solve the brachistochrone problem, and apply this method to two examples demonstrating its power.
For adiabatic controls of quantum systems, the nonadiabatic transitions are reduced by increasing the operation time of processes. Perfect quantum adiabaticity usually requires the infinitely slow variation of control parameters. In this paper, we propose the dynamical quantum geometric tensor, as a metric in the control parameter space, to speed up quantum adiabatic processes and reach quantum adiabaticity in relatively short time. The optimal protocol to reach quantum adiabaticity is to vary the control parameter with a constant velocity along the geodesic path according to the metric. For the system initiated from the nth eigenstate, the transition probability in the optimal protocol is bounded by ${P}_{n}(t)\ensuremath{\le}4{\mathcal{L}}_{n}^{2}/{\ensuremath{\tau}}^{2}$ with the operation time $\ensuremath{\tau}$ and the quantum adiabatic length Ln induced by the metric. Our optimization strategy is illustrated via two explicit models: the Landau-Zener model and the one-dimensional transverse Ising model.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.