We present a general theory for adiabatic evolution of quantum states as governed by the nonlinear Schrodinger equation, and provide examples of applications with a nonlinear tunneling model for Bose-Einstein condensates. Our theory not only spells out conditions for adiabatic evolution of eigenstates, but also characterizes the motion of non-eigenstates which cannot be obtained from the former in the absence of the superposition principle. We find that in the adiabatic evolution of non-eigenstates, the Aharonov-Anandan phases play the role of classical canonical actions.
We revisit the adiabatic criterion in stimulated Raman adiabatic passage for the three-level $Λ$-system, and compare the situation with and without nonlinearity. In linear systems, the adiabatic condition is derived with the help of the instantaneous eigenvalues and eigenstates of the Hamiltonian, a procedure that breaks down in the presence of nonlinearity. Using an explicit example relevant to photoassociation of atoms into diatomic molecules, we demonstrate that the proper way to derive the adiabatic condition for the nonlinear systems is through a linearization procedure.
We apply a flexible numerical integrator to the simulation of adiabatic quantum computation with nonlinear paths. We find that a nonlinear path may significantly improve the performance of adiabatic algorithms versus the conventional straight-line interpolations. The employed integrator is suitable for solving the time-dependent Schrödinger equation for any qubit Hamiltonian. Its flexible storage format significantly reduces cost for storage and matrix-vector multiplication in comparison to common sparse matrix schemes.
We investigate the acceleration of an adiabatic process with the same survival probability of the ground state by sweeping a parameter nonlinearly, fast in the wide gap region and slow in the narrow gap region, as contrast to the usual linear sweeping. We find the expected acceleration in the Laudau-Zener tunneling model and in the adiabatic quantum computing model for factorizing the number N=21.
We study dynamics of a two-color photoassociation of atoms into diatomic molecules via nonlinear Stimulated Raman adiabatic passage (STIRAP) process. This system has a famous counterpart in (linear) quantum mechanics, and been discussed recently in the context of generalizing quantum adiabatic theorem to nonlinear systems. Here we use another approach to study adiabaticity and stability in the system: we apply methods of classical Hamiltonian dynamics. We found nonlinear dynamical instabilities, cases of complete integrability, and improved conditions of adiabaticity.
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased s…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled adiabatic evolutions in the place of classically controlled evolution. An important question remains: what is the relative power of controlled adiabatic evolution to traditional adiabatic evolutions? We address this by showing that coherent control and measurement provides a way to average different adiabatic evolutions in ways that cause their diabatic errors to ca…
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified version of the adiabatic evolution in that paper can improve the performance to constant time.
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final …
Using shortcuts to adiabaticity, we solve the time-dependent Schroedinger equation that is reduced to a classical nonlinear integrable equation. For a given time-dependent Hamiltonian, the counterdiabatic term is introduced to prevent nonadiabatic transitions. Using the fact that the equation for the dynamical invariant is equivalent to the Lax equation in nonlinear integrable systems, we obtain the counterdiabatic term exactly. The counterdiabatic term is available when the corresponding Lax pair exists and the solvable systems are classified in a unified and systematic way. Multisoliton pote…
We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic evolution with geometric phases is provided and we determine that in the adiabatic evolution, while the eigenstates are slowly varying, the eigenenergies and degeneracy of the Hamiltonian can change rapidly. We exemplify this result by the example of the adiabatic evolution driven by parametrized pulse sequences. For driving fields that are rotating slowly with …
Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum adiabatic evolutions. We show that this relation can be generalized to the case of mixed states.
Macroscopic cat states have been widely studied to illustrate fundamental principles of quantum physics as well as their application in quantum information processing. In this paper, we propose a quantum speedup method for adiabatic creation of cat states in a Kerr nonlinear resonator via gradient-descent optimal adiabatic control. By simultaneously adiabatic tuning the the cavity detuning and driving field strength, the width of minimum energy gap between the target trajectory and non-adiabatic trajectory can be widen, which allows us to speed up the evolution along the adiabatic path. Compar…
Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation. It is shown that in some cases the found condition is necessary and sufficient. The adiabatic theorem is generalized for the case of nonlinear Hamiltonians.
The unitary operator corresponding to the classical canonical transformation that connects a general closed system to an open system under adiabatic conditions is found. The quantum invariant operator of the adiabatic open system is derived from the unitary transformation of the quantum Hamiltonian of the closed system. On the basis of these results, we investigate the evolution of the general quantum adiabatic system and construct a revised adiabatic theorem. The adiabatic theorem developed here exactly reduces to the well-known Berry adiabatic theorem when the control parameter
The geometric phase acquired by the vector states under an adiabatic evolution along a noncyclic path can be calculated correctly in any instantaneous basis of a Hamiltonian that varies in time due to a time-dependent classical field.
It has recently been shown that a parametrically driven oscillator with Kerr nonlinearity yields a Schrödinger cat state via quantum adiabatic evolution through its bifurcation point and a network of such nonlinear oscillators can be used for solving combinatorial optimization problems by bifurcation-based adiabatic quantum computation [H. Goto, Sci. Rep. \textbf{6}, 21686 (2016)]. Here we theoretically show that such a nonlinear oscillator network with controllable parameters can also be used for universal quantum computation. The initialization is achieved by a quantum-mechanical bifurcation…
I'm presenting a new elegant formulation of the theory of fully nonlinear adiabatic TWM (FNA-TWM) in terms of elliptic function here. Note that the linear case of SFG and DFG in the undepleted pump approximation described by the FVH representation has been exploited several years ago. For the sake of completeness, I present the pseudo-FVH representation to describe OPA. Moreover, I'm trying to display an overview of TWM processes and show that both the linear cases, the linear adiabatic SFG(DFG) and the linear OPA, are only the special cases of my theory. Finally I also point out that the geom…
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of the instantaneous energy gap -- is found to maximize the ground state probability compared with other adiabatic methods while only requiring knowledge of the lowest $\sim N$ of the $2^N$ Hamiltonian eigenvalues. We also demonstrate that the ground state ordering can be experimentally identified as the most probable of all possible spin configurations, even whe…
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of coherent states, such as Schrodinger cat states. Therefore, these quantum computers are referred to as "quantum bifurcation machines (QbMs)." QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising fo…
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 investigate the effect of nonlinearity in a system described by an adiabatically evolving Hamiltonian. Experiments are conducted in a three-core waveguide structure that is adiabatically varying with distance, in analogy to the STIRAP process in atomic physics. In the linear regime, the system exhibits an adiabatic power transfer between two waveguides which are not directly coupled, with negligible power recorded in the intermediate coupling waveguide. In the presence of nonlinearity the behavior of this configuration is drastically altered and the adiabatic light passage is found to criti…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiabatic evolution algorithm, using the extended Hamiltonian. We present the exact relation between the energy gap and the elements of the extended Hamiltonian, which provides the new point of view to reduce …
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation, we design one of the schemes without any prior knowledge of the instantaneous eigenstates of the final Hamiltonian. Whereas in another scheme, the control is constructed with the instantaneous eigenstate that is the target state of the control. As an illustration, we study a two-level system driven by a time-dependent magnetic field under the control. The phy…
Adiabatic processes in the quantum Ising model and the anisotropic Heisenberg model are discussed. The adiabatic processes are assumed to consist in the slow variation of the strength of the magnetic field that environs the spin-systems. These processes are of current interest in the treatment of cold atoms in optical lattices and in Adiabatic Quantum Computation. We determine the probability that, during an adiabatic passage starting from the ground state, states with higher energy are excited.
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 m…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector Hamiltonians on the corresponding ground state. If the overlap between the initial state and final state of the quantum system is not equal to zero, both of these models can provide a constant time speedup over the usual adiabatic algorithms by increasing some another corresponding "complexity". But when the initial state has a zero overlap with the solution stat…
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…
In a recent Letter [Phys. Rev. Lett. {\bf 95}, 080502 (2005)], an interesting scheme was proposed to implement a type of conditional quantum phase gates with built-in fault-tolerant feature via adiabatic evolution of dark eigenstates. In this comment we elaborate the geometric nature of the gate scheme and clarify that it still belongs to a class of conventional geometric quantum computation.
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building blocks in the construction of arbitrary `adiabatic circuits', analogously to the manner in which gates are used in the circuit model. One implication of the above construction is that arbitrary classical boolean circuits as well as gate model circuits may be directly translated to adiabatic algorithms with no additional resources or complexities. We show that …
A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The proposal is valid for any spatial dimensional cluster states. Errors induced by thermal fluctuations and adiabatic evolution within finite time can be eliminated ensuring fault-tolerant quantum computing schemes.
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 0423…
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 …
We expand upon the standard quantum adiabatic theorem, examining the time-dependence of quantum evolution in the near-adiabatic limit. We examine a Hamiltonian that evolves along some fixed trajectory from $\hat{H}_0$ to $\hat{H}_1$ in a total evolution-time $τ$, and our goal is to determine how the final state of the system depends on $τ$. If the system is initialized in a non-degenerate ground state, the adiabatic theorem says that in the limit of large $τ$, the system will stay in the ground state. We examine the near-adiabatic limit where the system evolves slowly enough that most but not …
We investigate the Landau-Zener tunneling (LZT) of a self-interacting two-level system in which the coupling between the levels is nonreciprocal. In such a non-Hermitian system, when the energy bias between two levels is adjusted very slowly, i.e., in the adiabatic limit, we find that a quantum state can still closely follow the eigenstate solution until it encounters the exceptional points (EPs) at which two eigenvalues and their corresponding eigenvectors coalesce. In the absence of the nonlinear self-interaction, we can obtain explicit expressions for the eigenvectors and eigenvalues and an…
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the time complexity, which is $O(\sqrt{N/M})$, of the local adiabatic search algorithm\cite{Roland2002}, to $O(\sqrt{N}/M)$.
Quantum adiabatic evolution, an important fundamental concept inphysics, describes the dynamical evolution arbitrarily close to the instantaneous eigenstate of a slowly driven Hamiltonian. In most systems undergoing spontaneous symmetry-breaking transitions, their two lowest eigenstates change from non-degenerate to degenerate. Therefore, due to the corresponding energy-gap vanishes, the conventional adiabatic condition becomes invalid. Here we explore the existence of quantum adiabatic evolutions in spontaneous symmetry-breaking transitions and derive a symmetry-dependent adiabatic condition.…
We show that the difference of adiabatic phases, that are basis-dependent, in noncyclic evolution of non-degenerate quantum systems have to be taken into account to give the correct interference result in the calculation of physical quantities in states that are a superposition of instantaneous eigenstates of energy. To verify the contribution of those adiabatic phases in the interference phenomena, we consider the spin-1/2 model coupled to a precessing external magnetic field. In the model, the adiabatic phase increases in time up to reach the difference of the Berry's phases of the model whe…
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adiabatic algorithm succeeds in polynomial time whereas simulated annealing requires exponential time.
We aim to give more insights on adiabatic evolution concerning the occurrence of anti-crossings and their link to the spectral minimum gap $Δ_{min}$. We study in detail adiabatic quantum computation applied to a specific combinatorial problem called weighted max $k$-clique. A clear intuition of the parametrization introduced by V. Choi is given which explains why the characterization isn't general enough. We show that the instantaneous vectors involved in the anti-crossing vary brutally through it making the instantaneous ground-state hard to follow during the evolution. This result leads to a…
In this paper, we discuss time evolution and adiabatic approximation in $PT$-symmetric quantum mechanics. we give the time evolving equation for a class of $PT$-symmetric Hamiltonians and some conditions of the adiabatic approximation for the class of $PT$-symmetric Hamiltonians.
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, …
We extend the concept of locality to enclose a situation where a tensor-product structure for the Hilbert space is not \textit {a priori} assumed; rather, this locality is related to a given matrix representation of the Hamiltonian associated to the system. As a result, we formulate a Lieb-Robinson-like bound for Hamiltonians local in a given basis. In particular, we employ this bound to obtain alternatively the adiabatic condition, where adiabaticity is naturally ensued from a locality in energy basis and a relatively small Lieb-Robinson bound.
We first discuss the geometrical construction and the main mathematical features of the maximum-entropy-production/steepest-entropy-ascent nonlinear evolution equation proposed long ago by this author in the framework of a fully quantum theory of irreversibility and thermodynamics for a single isolated or adiabatic particle, qubit, or qudit, and recently rediscovered by other authors. The nonlinear equation generates a dynamical group, not just a semigroup, providing a deterministic description of irreversible conservative relaxation towards equilibrium from any non-equilibrium density operato…
A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al., quant-ph/0001106]. We apply this time-dependent Hamiltonian approach to the Grover's problem, i. e., searching a marked item in an unstructured database. We find that, by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N}$, where $N$ is the number…
A classical-kind phase-space formalism is developed to address the tiny intrinsic dynamical deviation from what is predicted by Wilczek-Zee theorem during quantum adiabatic evolution on degeneracy levels. In this formalism, the Hilbert space and the aggregate of degenerate eigenstates become the classical-kind phase-space and a high-dimensional subspace in the phase-space, respectively. Compared with the previous same study by a different method, the current result is qualitatively different in that the first-order deviation derived here is always perpendicular to the degeneracy subspace. A tr…
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investi…
The theory of geometric phase is generalized to a cyclic evolution of the eigenspace of an invariant operator with $N$-fold degeneracy. The corresponding geometric phase is interpreted as a holonomy inherited from the universal connection of a Stiefel U(N)-bundle over a Grassmann manifold. Most significantly, for an arbitrary initial state, this geometric phase captures the inherent geometric feature of the state evolution. Moreover, the geometric phase in the evolution of the eigenspace of an adiabatic action operator is also addressed, which is elaborated by a pullback U(N)-bundle. Several i…
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 …
Mean-field approach has recently been used to model coupled atom-molecular Bose-Einstein condensates (BEC) and coupled Fermi-Bose condensates near Feshbach resonance. Sweeping of magnetic field across the resonance gives a new (nonlinear) version of Landau-Zener problem. We investigate the structure of the corresponding classical phase space and calculate change in the action which corresponds to finite-rate efficiency of the sweep. We consider the case of non-zero initial action, which corresponds to some finite initial molecular fraction.
Self-intersecting energy band structures in momentum space can be induced by nonlinearity at the mean-field level, with the so-called nonlinear Dirac cones as one intriguing consequence. Using the Qi-Wu-Zhang model plus power law nonlinearity, we systematically study in this paper the Aharonov-Bohm (AB) phase associated with an adiabatic process in the momentum space, with two adiabatic paths circling around one nonlinear Dirac cone. Interestingly, for and only for Kerr nonlinearity, the AB phase experiences a jump of $π$ at the critical nonlinearity at which the Dirac cone appears or disappea…
One of the challenges of adiabatic control theory is the proper inclusion of the effects of dissipation. Here, we study the adiabatic dynamics of an open two-level quantum system deriving a generalized master equation to consistently account for the combined action of the driving and dissipation. We demonstrate that in the zero temperature limit the ground state dynamics is not affected by environment. As an example, we apply our theory to Cooper pair pumping which demonstrates the robustness of ground state adiabatic evolution.
