Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on the corresponding ground state. The minimum energy gap which governs the time required for a successful evolution is shown to be proportional to the overlap of the ground states of the initial and final Hamiltonians. We show that such evolutions exhibit a rapid crossover as the ground state changes abruptly near the transition point where the energy gap is minimum. Furthermore, a faster evolution can be obtained by performing a partial adiabatic evolution within a narrow interval around the transition point. These results generalize and quantify earlier works.
We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to the ground state. For large problem sizes the gap decreases exponentially and as a consequence the required running time is also exponential.
We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build on Feynman's Hamiltonian computer idea and use a railroad-switch type clock register. The resources required to simulate a quantum circuit with L gates in this model are O(L) small-dimensional quantum systems (qubits or qutrits), a time-independent Hamiltonian composed of O(L) local, constant norm, projector terms, the possibility to prepare computational b…
We prove the existence of a unitary transformation that enables two arbitrarily given Hamiltonians in the same Hilbert space to be transformed into one another. The result is straightforward yet, for example, it lays the foundation to implementing or mimicking dynamics with the most controllable Hamiltonian. As a promising application, this existence theorem allows for a rapidly evolving realization of adiabatic quantum computation by transforming a Hamiltonian where dynamics is in the adiabatic regime into a rapidly evolving one. We illustrate the theorem with examples.
Inspired by a recently constructed commuting-projector Hamiltonian for a two-dimensional (2D) time-reversal-invariant topological superconductor [Wang et al., Phys. Rev. B 98, 094502 (2018)], we introduce a commuting-projector model that describes an interacting yet exactly solvable 2D topological insulator. We explicitly show that both the gapped and gapless boundaries of our model are consistent with those of band-theoretic, weakly interacting topological insulators. Interestingly, on certain lattices our time-reversal-symmetric models also enjoy $\mathcal{CP}$ symmetry, leading to intuitive…
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that maps every non-stoquastic adiabatic path ending in a classical Hamiltonian to a corresponding stoquastic adiabatic path by appropriately adjusting the phase of each matrix entry in the computational basis. We compare the spectral gaps of these adiabatic paths and find both theoretically and numerically that the paths based on non-stoquastic Hamiltonians have …
We discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the adiabatic algorithm of the Grover's problem. We discuss two possible implementations of STA for the adiabatic quantum computations: the method of quantum adiabatic brachistochrone and the Lewis-Riesenfeld invariant-based inverse engineering.
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic passage. However, this approach had issues with the precision of the effective Hamiltonian and with the adiabaticity of the evolution. In order to address these, we here propose and experimentally demonstrate a novel scheme for adiabatic quantum computation by using the intrinsic Hamiltonian of a realistic spin system to represent the problem Hamiltonian whi…
For a T-periodic non-Hermitian Hamiltonian H(t), we construct a class of adiabatic cyclic states of period T which are not eigenstates of the initial Hamiltonian H(0). We show that the corresponding adiabatic geometric phase angles are real and discuss their relationship with the conventional complex adiabatic geometric phase angles. We present a detailed calculation of the new adiabatic cyclic states and their geometric phases for a non-Hermitian analog of the spin 1/2 particle in a precessing magnetic field.
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that for certain Hamiltonians, which remain frustration-free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a new, a…
The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bi-partite quantum state-space. When the different Hamiltonians in the family fall in the same adiabatic class one can manipulate entanglement by moving through energy eigenstates corresponding to different value of the control parameters. We introduce an associated notion of adiabatic entangling power. This novel measure is analyzed for general $d\times d$ quantum systems and specific two-qubits exampl…
Here we consider the power of a line of quantum particles under a nearest-neighbor 2-local Hamiltonian. Currently, it has been shown that 8-state particles are sufficient for universal adiabatic computing. We improve this result to show that 7-state particles are sufficient.
The adiabatic approximation in open systems is formulated through the effective Hamiltonian approach. By introducing an ancilla, we embed the open system dynamics into a non-Hermitian quantum dynamics of a composite system, the adiabatic evolution of the open system is then defined as the adiabatic dynamics of the composite system. Validity and invalidity conditions for this approximation are established and discussed. A High-order adiabatic approximation for open systems is introduced. As an example, the adiabatic condition for an open spin-$\frac 1 2$ particle in time-dependent magnetic fiel…
We present a new method for finding isolated exact solutions of a class of non-adiabatic Hamiltonians of relevance to quantum optics and allied areas. Central to our approach is the use of Bogoliubov transformations of the bosonic fields in the models. We demonstrate the simplicity and efficiency of this method by applying it to the Rabi Hamiltonian.
We propose a method to produce fast transitionless dynamics for finite-dimensional quantum systems without requiring additional Hamiltonian components not included in the initial control setup, remaining close to the true adiabatic path at all times. The strategy is based on the introduction of an effective counterdiabatic scheme: a correcting Hamiltonian is constructed which approximatively cancels nonadiabatic effects, inducing an evolution tracking the adiabatic states closely. This can be absorbed into the initial Hamiltonian by adding a fast oscillation in the control parameters. We show …
Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real, nonnegative amplitudes. This raises the question of whether classical Monte Carlo algorithms can efficiently simulate quantum adiabatic optimization with stoquastic Hamiltonians. Recent results have given counterexamples in which path integral and diffusion Monte Carlo fail to do so. However, most adiabatic optimization algorithms, such as for solving MAX-k-SAT problems, use k-local Hamiltonians, whereas our previous counterexample for diffusion Mo…
Polynomially-large ground-state energy gaps are rare in many-body quantum systems, but useful for adiabatic quantum computing. We show analytically that the gap is generically polynomially-large for quadratic fermionic Hamiltonians. We then prove that adiabatic quantum computing can realize the ground states of Hamiltonians with certain random interactions, as well as the ground states of one, two, and three-dimensional fermionic interaction lattices, in polynomial time. Finally, we use the Jordan-Wigner transformation and a related transformation for spin-3/2 particles to show that our result…
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution (H(epsilon t), epsilon ? 0), are insufficient to describe an evolution driven by the hamiltonian H(t) itself. Here we derive general criteria and exact bounds, for the state and its phase, ensuring an adiabatic evolution for any hamiltonian H(t). As a corollary we demonstrate that the commonly used condition of a slow hamiltonian variation rate, compared to the spectral…
We present the formulation of the problem of the coherent dynamics of quantum mechanical two-level systems in the adiabatic region in terms of the differential geometry of plane curves. We show that there is a natural plane curve corresponding to the Hamiltonian of the system for which the geometrical quantities have a simple physical interpretation. In particular, the curvature of the curve has the role of the nonadiabatic coupling.
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the computational basis, that is a product basis for qubits. We point out that $H_{\rm p}$ can be chosen to be non-diagonal in the computational basis. To be more precise, we show how to construct $H_{\rm p}$ in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and …
Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the error incurred from using the adiabatic approximation for quantum systems. Our bounds are often asymptotically tight in the limit of slow evolution for fixed Hamiltonians, and are used to provide sufficient conditions for the application of the adiabatic approximation. We show that our sufficiency criteria exclude the Marzlin--Sanders counterexample from th…
We discussed a method to accelerate an adiabatic quantum dynamics of XY spin model by using the fast-forward method proposed by Masuda and Nakamura. The Accelerated scheme is constructed by adding the driving Hamiltonian to the original Hamiltonian and speeding it up with a large time-scaling factor and an adiabatic parameter that realizes adiabatic quantum dynamics in a shortened time. Accelerated adiabatic dynamics start by assuming the candidate of driving Hamiltonian consists of the pair-wise exchange interaction and magnetic field. The driving Hamiltonian terms multiplied by the velocity …
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working towards the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known QMA-complete 2-local Hamiltonians. The 2-local Ising model with 1-local …
We consider whether or not Hamiltonians which are sums of commuting projectors have "trivial" ground states which can be constructed by a local quantum circuit of bounded depth and range acting on a product state. While the toric code only has nontrivial ground states, commuting projector Hamiltonians which are sums of two-body interactions have trivial ground states. We define an "interaction complex" for a Hamiltonian, generalizing the interaction graph, and we show that if this complex can be continuously mapped to a 1-complex using a map with bounded diameter of pre-images then the Hamilto…
We formulate a non-relativistic Hamiltonian in order to describe the interaction between a moving dielectric membrane and radiation pressure. Such a Hamiltonian is derived without making use of the single-mode adiabatic approximation, and hence it enables us to incorporate multi-mode effects in cavity optomechanics. By performing second quantization, we show how a set of generalized Fock states can be constructed to represent quantum states of the membrane and cavity field. In addition, we discuss examples showing how photon scattering among different cavity modes would modify the interaction …
The smallness of the variation rate of the hamiltonian matrix elements compared to the (square of the) energy spectrum gap is usually believed to be the key parameter for a quantum adiabatic evolution. However it is only perturbatively valid for scaled timed hamiltonian and resonance processes as well as off resonance possible constructive Stückelberg interference effects violate this usual condition for general hamiltionian. More general adiabatic condition and exact bounds for adiabatic quantum evolution are derived and studied in the framework of a two-level system. The usual criterion is r…
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D. Our results demonstrat…
In this report, we explore the use of a quantum optimization algorithm for obtaining low energy conformations of protein models. We discuss mappings between protein models and optimization variables, which are in turn mapped to a system of coupled quantum bits. General strategies are given for constructing Hamiltonians to be used to solve optimization problems of physical/chemical/biological interest via quantum computation by adiabatic evolution. As an example, we implement the Hamiltonian corresponding to the Hydrophobic-Polar (HP) model for protein folding. Furthermore, we present an approa…
A condition on the Hamiltonian of a time-dependent quantum mechanical system is derived which, if satisfied, implies optimal adiabaticity (defined below). The condition is expressed in terms of the Hamiltonian and in terms of the evolution operator related to it. Since the latter depends in a complicated way on the Hamiltonian, it is not yet clear how the condition can be used to extract useful information about the optimal Hamiltonian. The condition is tested on an exactly-soluble time-dependent problem (a spin in a magnetic field), where perfectly adiabatic evolution can be easily identified…
We generalize the quantum adiabatic theorem to the non-Hermitian system and build a rigorous adiabaticity condition with respect to the adiabatic phase. The non-Hermitian Hamiltonian inverse engineering method is proposed for the purpose to adiabatically drive a artificial quantum state. For the sake of clearness, we take a concrete two-level system as an example to show the usefulness of the inverse engineering method. The numerical simulation result shows that our scheme can work well even under noise if the parameters are chosen appropriately. We can obtain the desired target state by adjus…
The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as the Hamiltonian dynamics is present. In the special case of pure decoherence where the environment monitors the search Hamiltonian, it is shown that the local adiabatic quantum search performs as the classical search.
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for short running time to inverse-square decay for long running time. The size dependence of the critical running time is expressed in terms of Lambert $W$ function. The transitionless driving Hamiltonian is obtained to make a quantum state follow the adiabatic path. We demonstrate that a constant Ha…
We numerically simulate the effects of noise-induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP-Complete problem N-bit Exact Cover 3. The noise-averaged median runtime is determined as the noise-power and number of bits N are varied, and power-law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise-power values. We discuss whether this shift might be connected to arguments in the liter…
We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by physically reasonable Hamiltonians like short-range interactions.
We study the Ising Hamiltonian with a transverse field term to simulate the quantum annealing. Using shortcuts to adiabaticity, we design the time dependence of the Hamiltonian. The dynamical invariant is obtained by the mean-field ansatz, and the Hamiltonian is designed by the inverse engineering. We show that the time dependence of physical quantities such as the magnetization is independent of the speed of the Hamiltonian variation in the infinite-range model. We also show that rotating transverse magnetic fields are useful to achieve the ideal time evolution.
Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized …
We show that the adiabatic approximation for nonselfadjoint hamiltonians seems to induce two non-equal expressions for the geometric phase. The first one is related to the spectral projector involved in the adiabatic theorem, the other one is the adiabatic limit of the nonadiabatic geometric phase. This apparent inconsistency is resolved by observing that the difference between the two expressions is compensated by a small deviation in the dynamical phases.
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size $N$ can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
We show that the definition of instantaneous eigenstate populations for a dynamical non-self-adjoint system is not obvious. The naive direct extension of the definition used for the self-adjoint case leads to inconsistencies; the resulting artifacts can induce a false inversion of population or a false adiabaticity. We show that the inconsistency can be avoided by introducing geometric phases in another possible definition of populations. An example is given which demonstrates both the anomalous effects and their removal by our approach.
Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming symmetric potentials, such as the well studied "spike" example. Due to the large amount of symmetry in these potentials such problems are readily open to analysis both analytically and computationally. However, more realistic potentials do not have such a high degree of symmetry and may have many local minima. Here we present a somewhat more realistic class of problems consisting of many individually Hamming symmetric potential wells. For two or three such wells we demonstrate that such a…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths…
The time or cost of simulating a quantum circuit by adiabatic evolution is determined by the spectral gap of the Hamiltonians involved in the simulation. In "standard" constructions based on Feynman's Hamiltonian, such a gap decreases polynomially with the number of gates in the circuit, L. Because a larger gap implies a smaller cost, we study the limits of spectral gap amplification in this context. We show that, under some assumptions on the ground states and the cost of evolving with the Hamiltonians (which apply to the standard constructions), an upper bound on the gap of order 1/L follows…
The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic if the change in eigenstate is significant, regardless of how closely the evolution satisfies the requirements of the adiabatic theorem. We also introduce an example of a two-level system with an exactly solvable evolution to demonstrate the inapplicability of the adiabatic approximation for a particular slowly varying Hamiltonian.
We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O(L^5)$. However, we show that it has the interesting property that it can map the temporal order of gates to the …
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent 2-qubit ZZ and XX+YY interactions on an (almo…
Certain alternative properties of physical systems are describable by supports of arguments of response functions (e.g. light cone, borders of media) and expressed by projectors; corresponding equations of restraints lead to dispersion relations, theorems of counting, etc. As supports are measurable, their absolutely strict borders contradict the spirit of quantum theory and their quantum evolution leading to appearance of subtractions or certain needed flattening would be considered. Flattening of projectors introduce transitive zones that can be examined as a specification of adiabatic hypot…
Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between non-degenerate instantaneous eigen-energy levels in such a dynamical evolution. However, this is true only when the driving rate is infinitesimally small. For a small nonzero driving rate, there are generally small transition probabilities between the energy levels. We develop a classical mechanics framework to address the small deviations from the quantum adiabatic theorem order by order. A hierarchy of Hamiltonians are …
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with techniques from other fields the emphasis on the existence of widely separated scales. Given this fact, the question arises whether it is feasible to improve on the adiabatic approximation, similarly to some of those other approaches. A number of authors have addressed the issue from the quantum optics/atomic physics perspective, and have run into the issue of no…
We propose a novel non-Hermitian adiabatic quantum optimization algorithm. One of the new ideas is to use a non-Hermitian auxiliary "initial'' Hamiltonian that provides an effective level repulsion for the main Hamiltonian. This effect enables us to develop an adiabatic theory which determines ground state much more efficiently than Hermitian methods.
Adiabatic passage employs a slowly varying time-dependent Hamiltonian to control the evolution of a quantum system along the Hamiltonian eigenstates. For processes of finite duration, the exact time evolving state may deviate from the adiabatic eigenstate at intermediate times, but in numerous applications it is observed that this deviation reaches a maximum and then decreases significantly towards the end of the process. We provide a straightforward theoretical explanation for this welcome but often unappreciated fact. Our analysis emphasizes a separate adiabaticity criterion for high fidelit…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-local, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable inte…
