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.
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 …
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.
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.
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 …
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…
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…
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…
The problem of spin precession in a time-dependent magnetic field is considered in the adiabatic approximation where the field direction or the angular velocity of its rotation is changing slowly. The precession angles are given by integrals in a way similar to the semi-classical approximation for the Schrödinger equation.
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…
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…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. By far, there is no experimental realization of adiabatic quantum computation on a single solid spin system under ambient conditions, which has been proved to be a compatible candidate for scalable quantum computation. In this letter, we report on the first experimental realization of an adiab…
The use of the nuclear spins surrounding electron spin qubits as quantum registers and long-lived memories opens the way to new applications in quantum information and biological sensing. Hence, there is a need for generic and robust forms of control of the nuclear registers. Although adiabatic gates are widely used in quantum information, they can become too slow to outpace decoherence. Here, we introduce a technique whereby adiabatic gates arise from the dynamical decoupling protocols that simultaneously extend coherence. We illustrate this pulse-based adiabatic control for nuclear spins aro…
Many schemes to realize quantum state transfer in spin chains are not robust to random fluctuations in the spin-spin coupling strength. In efforts to achieve robust quantum state transfer, an adiabatic quantum population transfer scheme is proposed in this study. The proposed scheme makes use of a slowly moving external parabolic potential and is qualitatively explained in terms of the adiabatic following of a quantum state with a moving separatrix structure in the classical phase space of a pendulum analogy. Detailed aspects of our adiabatic population transfer scheme, including its robustnes…
We study the entanglement emergence in a dipolar-coupled nuclear spin-1/2 system cooled using the adiabatic demagnetization technique. The unexpected behavior of entanglement for the next- and next-next-neighbor spins is revealed: entangled states of a spin system appear in two distinct temperature and magnetic field regions separated by a zero-concurrence area. The magnetic field dependence of the concurrence can have two maximums which positions are determined by the initial conditions and number of spins in a chain.
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 study a single two-level system coupled resonantly to an oscillator mode or a large spin. By adiabatically turning on a linear driving term on the oscillator or the spin, the eigenstates of the system change character and its ground state evolves into squeezed states of the oscillator or the spin. The robust generation of such states is of interest in many experimental systems with applications for sensing and quantum information processing.
We show that the optical absorbance detection of nuclear spin echo gives direct access to the spin concentration, unlike most coherent signal detection techniques where the signal intensity/amplitude is difficult to connect experimentally with the spin concentration. This way we measure the spin refocusing efficiency in a crystal of Tm$^{3+}$:YAG. Given the large inhomogeneous broadening of the spin transition in this material, rephasing the spins with the usual hard pulse procedure would require excessively high radiofrequency power. Instead we resort to an adiabatic pulse sequence that perfe…
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 …
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…
We propose a method for quantum state transfer in spin chains using an adiabatic passage technique. Modifying even and odd nearest-neighbour couplings in time allows to achieve transfer fidelities arbitrarily close to one, without the need for a precise control of coupling strengths and timing. We study in detail transfer by adiabatic passage in a spin-1 chain governed by a generalized Heisenberg Hamiltonian. We consider optimization of the transfer process applying optimal control techniques. We discuss a realistic experimental implementation using cold atomic gases confined in deep optical l…
We consider transformation from a closed to an open spin chain and vice versa produced by changing single link strength in a pair of neighboring spins. We show that in the non-adiabatic time domain fidelity of such a process can be increased by proper choosing of the control function for spin-spin exchange coupling. We obtain this function for an antiferromagnetic quantum Ising chain and present heuristic reasons restricting possible time-dependences of Hamiltonians applied for a high-fidelity control.
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…
High-fidelity quantum operations are a key requirement for fault-tolerant quantum information processing. In electron spin resonance, manipulation of the quantum spin is usually achieved with time-dependent microwave fields. In contrast to the conventional dynamic approach, adiabatic geometric phase operations are expected to be less sensitive to certain kinds of noise and field inhomogeneities. Here, we investigate such phase gates applied to electron spins both through simulations and experiments, showing that the adiabatic geometric phase gate is indeed inherently robust against inhomogenei…
We propose a method to generate massive entanglement in a spinor Bose-Einstein condensate from an initial product state through adiabatic sweep of magnetic field across a quantum phase transition induced by competition between the spin-dependent collision interaction and the quadratic Zeeman effect. The generated many-body entanglement is characterized by the experimentally measurable entanglement depth in the proximity of the Dicke state. We show that the scheme is robust to practical noise and experimental imperfection and under realistic conditions it is possible to generate genuine entangl…
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.
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…
Mach-Zehnder interferometer, a powerful tool for a wide variety of measurements, has been realized with Bose-Einstein condensates in recent experiments. In this report, we propose and analyze a realizable scheme for performing a Heisenberg-limited Mach-Zehnder interferometry with dipolar spin-1 condensate. Based upon adiabatic processes of sweeping the transverse magnetic field, we demonstrate a perfect phase transition, which accomplishes the beam splitter, phase shifter and recombiner as for a Mach-Zehnder interferometer. The attractive dipolar interaction ensures the existence of a path-ent…
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 develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large time-scaling factor. Assuming the experimentally-realizable candidate Hamiltonian consisting of the exchange interactions and magnetic field, we solved the regularization terms. These terms multiplied by the velocity function give rise to the state-dependent counter-diabatic terms. The scheme needs neither knowledge of full spectral properties of the system nor…
Based on shortcuts to adiabaticity and quantum Zeno dynamics, we present a protocol to implement quantum state transfer (QST) in a quantum spin-1/2 chain. In the protocol, the complex Hamiltonian of an $N$-site system is simplified, and a simple effective Hamiltonian is present. It is shown that only the control of the coupling strengths between the boundary spins and the bulk spins are required for QST. Numerical simulations demonstrate that the protocol possesses high efficiency and is robust against the decay and the fluctuations of the control fields. The protocol might provide an alternat…
We propose a scheme which implements a controllable change of the state of the target spin qubit in such a way that both the control and the target spin qubits remain in their ground states. The interaction between the two spins is mediated by an auxiliary spin, which can transfer to its excited state. Our scheme suggests a possible relationship between the gate and adiabatic quantum computation.
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 …
In this work Controlled phase shift gates are implemented on a qaudrupolar system, by using non-adiabatic geometric phases. A general procedure is given, for implementing controlled phase shift gates in an 'N' level system. The utility of such controlled phase shift gates, is demonstrated here by implementing 3-qubit Deutsch-Jozsa algorithm on a 7/2 quadrupolar nucleus oriented in a liquid crystal matrix.
Confined electron spins are preferred candidates for embodying quantum information in the solid state. A popular idea is the use of optical excitation to achieve the ``best of both worlds'', i.e. marrying the long spin decoherence times with rapid gating. Here we study an all-optical adiabatic approach to generating single qubit phase gates. We find that such a gate can be extremely robust against the combined effect of all principal sources of decoherence, with an achievable fidelity of 0.999 even at finite temperature. Crucially this performance can be obtained with only a small time cost: t…
Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the system Hamiltonian. Here, we experimentally show using a nitrogen-vacancy center in diamond that, even in the presence of vanishing energy gaps, quantum adiabatic evolution is possible. This verifies a recently derived necessary and sufficient quantum adiabatic theorem and offers paths to overcome the conventionally assumed constraints on adiabatic methods. By …
The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn poses a fundamental speed limit. We show that by employing diabatic transitions via counter diabatic driving a less strict requirement on adiabaticity applies. We demonstrate a scaling advantage from local and multi-spin counter diabatic driving in the ground-state fidelity compared to their adiabatic counterpart, for different Ising spin models.
Starting from a simple mapping of a generator of local stochastic dynamics to a quantum Hamiltonian, we derive a condition, which allows us to use the quasi-adiabatic evolution and so relate gapped quantum phases with non-equilibrium's. This leads us to a study of invertible matrix product operators. Finally, we present an ansatz for constructing local stochastic dynamics for which the Perron-Frobenius vector has a Matrix Product Representation. Additionally, we get for free that the dynamics satisfy a generalized form of detailed balance.
We apply a quantum adiabatic evolution algorithm to a combinatorial optimization problem where the cost function depends entirely on the of the number of unit bits in a n-bit string (Hamming weight). The solution of the optimization problem is encoded as a ground state of the problem Hamiltonian H_p for the z-projection of a total spin-n/2. We show that tunneling barriers for the total spin can be completely suppressed during the algorithm if the initial Hamiltonian has its ground state extended in the space of the z-projections of the spin. This suppression takes place even if the cost functi…
