The Hamiltonian and evolution time of a quantum unitary system completely determine a unitary operator, which turns an initial state ${\ensuremath{\rho}}_{0}$ into its time-evolved state ${\ensuremath{\rho}}_{t}$ and may also turn another state ${\ensuremath{\sigma}}_{0}$ into its time-evolved state ${\ensuremath{\sigma}}_{t}$. Although the two pairs of states $({\ensuremath{\rho}}_{0},{\ensuremath{\rho}}_{t})$ and $({\ensuremath{\sigma}}_{0},{\ensuremath{\sigma}}_{t})$ are governed by the same Hamiltonian and experience equal evolution periods, their state distances are not necessarily equal to each other. Specifically, the evolution operator contains information about the evolution other than that reflected by two specific states connected through it. As a matter of fact, two pairs of states with different state distances may have equal path distances. Here we propose a geometric measure for the path distance contained in a quantum unitary evolution, which depends only on the unitary operator itself and is independent of any pair of states connected through it. This path distance meets the basic requirements for a good measure of distance and is valid during the whole evolution process, no matter how long the evolution time is. This path distance is bounded by the path length of the evolution from above and by the Bures angle between the two states connected through it from below. It has potential applications in quantum information processing, such as providing another way to study the optimal control between two quantum states. We finally present the form of Hamiltonian to realize a unitary operator on demand.
In a quantum unitary system, an initial state may have different paths to evolve to a target state, and the only requirement is that the initial and target states share the same eigenvalue spectrum. We focus on the evolution between two nondegenerate mixed states in this paper, and investigate the shortest evolution path between them. By minimizing the path distance contained in the unitary operator connecting the initial and target states over a series of phases, the shortest evolution path could be figured out. This minimum path distance has an analytical form in the single-qubit dynamical system, and its solution in the three- or higher-dimensional dynamical system could be obtained numerically. Based on the unitary operator associated with the shortest evolution path, a general form for the Hamiltonian to realize it is presented. Here we present another way to study quantum optimal control, which is based on the path distance between the initial state and its evolution state, rather than the state distance between them.
For any pair of quantum states, an initial state |I and a final quantum state |F , in a Hilbert space, there are many Hamiltonians H under which |I evolves into |F .Let us impose the constraint that the difference between the largest and smallest eigenvalues of H, E max and E min , is held fixed.We can then determine the Hamiltonian H that satisfies this constraint and achieves the transformation from the initial state to the final state in the least possible time τ .For Hermitian Hamiltonians, τ has a nonzero lower bound.However, among non-Hermitian PT -symmetric Hamiltonians satisfying the same energy constraint, τ can be made arbitrarily small without violating the time-energy uncertainty principle.The minimum value of τ can be made arbitrarily small because for PT -symmetric Hamiltonians the path from the vector |I to the vector |F , as measured using the Hilbert-space metric appropriate for this theory, can be made arbitrarily short.The mechanism described here is similar to that in general relativity in which the distance between two space-time points can be made small if they are connected by a wormhole.This result may have applications in quantum computing.
The adiabatic theorem is a powerful result concerning the evolution of quantum mechanical systems. Intuitively, it states the following: suppose we want to study the evolution of a quantum mechanical system governed by a given Hamiltonian
H (Def. 6.1), and the initial state of the system is the eigenstate of
H corresponding to its lowest eigenvalue. The laws of quantum physics tell us that the evolution of the system over time follows the Schrüdinger equation, Eq. (6.1). Suppose now that the Hamiltonian is not fixed, but rather, it changes very slowly over time, so that the evolution of the system is described by the differential equation
idtd∣ψ(t)⟩=H(t)∣ψ(t)⟩, and
H(t) is slowly changing. If, for any value of the time parameter
t, there is always a gap between the lowest eigenvalue of
H(t) and all other eigenvalues, then the adiabatic theorem asserts that the state of the system always remains in an eigenstate with the lowest eigenvalue throughout the evolution. One specific case of interest in this chapter occurs when the time-dependent Hamiltonian
H(t) varies from an initial (time-independent) Hamiltonian
HI to a final Hamiltonian
HF. If the change happens slowly, and the initial state of the system is an eigenstate of
HI with minimum eigenvalue, the adiabatic theorem asserts that the evolution eventually leads to the eigenstate with minimum eigenvalue of the final Hamiltonian
HF. This result can be used for optimization: imagine that the initial Hamiltonian encodes an easy problem for which we can construct the eigenstate with minimum eigenvalue, and the final Hamiltonian encodes a difficult optimization problem whose solution is given by the eigenstate with minimum eigenvalue. By the adiabatic theorem, evolving the eigenstate of the initial Hamiltonian while slowly changing the Hamiltonian into the final one leads to the solution of the difficult optimization problem. Of course we need to know how slowly
HI should be changed into
HF. The adiabatic theorem is at the heart of the quantum approximate optimization algorithm (QAOA), a framework that has been widely used to implement optimization algorithms on existing quantum hardware, because it has low requirements of quantum resources–although it does not guarantee improvements over classical algorithms in general. In this chapter we first discuss the adiabatic theorem, and then give an overview of QAOA.
I report a tight upper bound of the maximum speed of evolution from one quantum state $\ensuremath{\rho}$ to another ${\ensuremath{\rho}}^{\ensuremath{'}}$ with fidelity $F(\ensuremath{\rho},{\ensuremath{\rho}}^{\ensuremath{'}})$ less than or equal to an arbitrary but fixed value under the action of a time-independent Hamiltonian. Since the bound is directly proportional to the average absolute deviation from the median of the energy of the state
DE, one may interpret
DE as a meaningful measure of the maximum information-processing capability of a system.
We introduce a metric in a geometric way for measuring the distance between two quantum states and derive the instantaneous angular velocity of a quantum state's dynamical evolution, which has two components: $\mathrm{\ensuremath{\Delta}}{E}_{t}/\ensuremath{\hbar}$ in the longitudinal direction and ${\overline{E}}_{t}/\ensuremath{\hbar}$ in the latitudinal direction. By applying the instantaneous angular velocities in the dynamical evolution governed by a time-independent Hamiltonian, the fastest way for a pure state to evolve to a target state is discussed. As a consequence, we generalize the Mandelstam-Tamm and Margolus-Levitin bounds without using the Heisenberg uncertainty relation and point out the conditions for saturating the two bounds. The fastest dynamical evolution of a quantum system with a particular time-dependent Hamiltonian is also briefly discussed. The quantum features in the dynamical evolution are revealed through phase change and lifetime of the initial state.