We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast to closed systems, we show that a system may initially be in an adiabatic regime, but then undergo a transition to a regime where adiabaticity breaks down. As a consequence, the success of AQC depends sensitively on the competition between various pertinent rates, giving rise to optimality criteria.
A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting many-body systems often decreases quickly with the number of qubits, and the quantum adiabaticity can be severely impaired. Despite numerous previous efforts, a practical method to preserve the quantum adiabaticity has yet to be developed. Here we present a universal approach to enhancing the quantum adiabaticity via cavity or circuit QED. By coupling an adiabati…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of local minima close to the global minimum, the gap becomes exponentially small making the computation time exponentially long. The quantum advantage of adiabatic quantum computation may then be accessed only via the local adiabatic evolution, which requires phase coherence throughout the evolution and knowledge of the spectrum. Such problems, therefore, are not s…
We study the effect of a thermal environment on adiabatic quantum computation using the Bloch-Redfield formalism. We show that in certain cases the environment can enhance the performance in two different ways: (i) by introducing a time scale for thermal mixing near the anticrossing that is smaller than the adiabatic time scale, and (ii) by relaxation after the anticrossing. The former can enhance the scaling of computation when the environment is superohmic, while the latter can only provide a prefactor enhancement. We apply our method to the case of adiabatic Grover search and show that perf…
Entanglement is the central resource in adiabatic quantum transport. Dephasing affects the availability of that resource by biasing trajectories, driving transitions between success and failure. This depletion of entanglement is important for the practical implementation of quantum technologies. We present a new perspective on the failure of adiabatic computation by understanding the failure of adiabatic transport as a dynamical phase transition. These ideas are demonstrated in a toy model of adiabatic quantum transport in a two spin system.
The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations of the adiabatic theorem all arise from resonant transitions between energy levels. In the absence of fast driven oscillations the traditional adiabatic theorem holds. Implications for adiabatic quantum computation is discussed.
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum c…
We have studied the decoherence properties of adiabatic quantum computation (AQC) in the presence of in general non-Markovian, e.g., low-frequency, noise. The developed description of the incoherent Landau-Zener transitions shows that the global AQC maintains its properties even for decoherence larger than the minimum gap at the anticrossing of the two lowest energy levels. The more efficient local AQC, however, does not improve scaling of the computation time with the number of qubits $n$ as in the decoherence-free case. The scaling improvement requires phase coherence throughout the computat…
We analyze the influence of a dissipative environment on geometric phases in a quantum system subject to non-adiabatic evolution. We find dissipative contributions to the acquired phase and modification of dephasing, considering the cases of weak short-correlated noise as well as of slow quasi-stationary noise. Motivated by recent experiments, we find the leading non-adiabatic corrections to the results, known for the adiabatic limit.
We report theoretical studies of adiabatic population transfer using dressed spin states. Quantum optimal control using the algorithm of Chopped Random Basis (CRAB) has been implemented in a negatively charged diamond nitrogen vacancy center that is coupled to a strong and resonant microwave field. We show that the dressed spin states are highly effective in suppressing effects of spin dephasing on adiabatic population transfer. The numerical simulation also demonstrates that CRAB-based quantum optimal control can enable an efficient and robust adiabatic population transfer.
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.
We apply the transitionless quantum driving method to control the electron spin of a two-electron double quantum dot with spin-orbit coupling by time-dependent electric fields. The $x$ and $y$ components of applied electric fields in each dot are designed to achieve fast adiabatic-like passage in the nanosecond timescale. To simplify the setup, we can further transform Hamiltonian by z axis to design an alternative speed-up adiabatic passage, without using the applied electric field in $y$ direction.
It is shown that efficient and robust universal quantum computation is possible using the stimulated Raman adiabatic passage with a qubit chain as a pointer register.
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
We introduce high-order dynamical decoupling strategies for open system adiabatic quantum computation. Our numerical results demonstrate that a judicious choice of high-order dynamical decoupling method, in conjunction with an encoding which allows computation to proceed alongside decoupling, can dramatically enhance the fidelity of adiabatic quantum computation in spite of decoherence.
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.
The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of parameter-dependent Hamiltonians. By contrast, discrete adiabatic computation utilizes adiabatic passage along the quasienergies of parameter-dependent unitary operators. For example, such computation can be realized by a concatenation of parameterized quantum circuits, with an adiabatic though inevitably discrete change of the parameter. A design principle of adiaba…
We propose a non-adiabatic scheme for geometric quantum computation with trapped ions. By making use of the Aharonov-Anandan phase, the proposed scheme not only preserves the globally geometric nature in quantum computation, but also provides the advantage of non-adiabaticity that overcomes the problem of slow evolution in the existing adiabatic schemes. Moreover, the present scheme requires only two atomic levels in each ion, making it an appealing candidate for quantum computation.
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and excited states. However, it is difficult to ascertain the exact value of the energy gap. In this paper, we put forward a theorem on the existence of nonzero energy gap for the Hamiltonians used in adiabatic quantum computation. It can help to effectively identify a large class of the Hamiltonians without energy-level crossing between the ground and excited sta…
We show that the quantum Fisher information attained in an adiabatic approach to critical quantum metrology cannot lead to the Heisenberg limit of precision and therefore regular quantum metrology under optimal settings is always superior. Furthermore, we argue that even though shortcuts to adiabaticity can arbitrarily decrease the time of preparing critical ground states, they cannot be used to achieve or overcome the Heisenberg limit for quantum parameter estimation in adiabatic critical quantum metrology. As case studies, we explore the application of counter-diabatic driving to the Landau-…
For a finite XY chain and a finite two-dimensional Ising lattice, it is shown that the paramagnetic ground state is adiabatically transformed to the GHZ state in the ferromagnetic phase by slowly turning on the magnetic field. The fidelity between the GHZ state and an adiabatically evolved state shows a feature of the quantum phase transition.
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit gates can be implemented by utilizing optical transitions in a generic three-level $Λ$ configuration. Our scheme opens up for universal holonomic quantum computation on qubits characterized by short coherence times.
Adiabatic quantum computation for performing quantum computations such as Shor's algorithm is protected against thermal errors by an energy gap of size $O(1/n)$, where $n$ is the length of the computation to be performed.
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 …
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, non-adiabatic holonomic quantum computation in decoherence-free subspaces, which avoids long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize non-adiabatic holonomic quantum computation in decoherence-free…
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…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401 (2017)]. Here we tailor this condition for estimating run times of quantum adiabatic algorithms. As an illustration, the condition is applied to the adiabatic algorithm for searching in an unstructured database (adiabatic Grover search algorithm). We find that thus obtained lower bound …
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state. The proof relies on a recently proven area law for such systems, implying the existence of a good matrix product representation of the ground state, combined with an appropriate algorithm to update the matrix product state as the Hamiltonian is changed. This implies that adiabatic evolution with such Hamiltonians is not useful for universal quantum computati…
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 proposal of the optical scheme for holonomic quantum computation is evaluated based on dynamical resolution to the system beyond adiabatic limitation. The time-dependent Schrödinger equation is exactly solved by virtue of the cranking representation and gauge transformation approach. Besides providing rigorous confirmation to holonomies of the geometrical prediction that holds for the ideally adiabatic situation, the dynamical resolution enables one to evaluate elaborately the amplitude of the nonadiabatic deviation, so that the errors induced to the quantum computation can be explicitly e…
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive protection protocol can be especially advantageous for continuous quantum computation such as quantum annealers. As an example we propose to use decoherence protected adiabatic quantum computation for the Grover search problem. Our proposal contains only two-body interactions, making it feasible in near-term quantum devices.
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 …
Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and…
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…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short decoherence time. Here we demonstrate quantum adiabatic state transfers that jump along geodesics in one-qubit and two-qubit superconducting transmons. This approach possesses the advantages of speed, robustness, and high fidelity compared with the usual adiabatic process. Our protocol provides feasible strategies for improving state manipulation and gate op…
According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and non-infinitesimal time steps, we can only obtain an approximate vacuum that is supposed to be a superposition of a true vacuum and excited states. We propose a procedure to improve the approximate vacuum.
A simple proof of quantum adiabatic theorem is provided. Quantum adiabatic approximation is divided into two kinds. For Hamiltonian H(t/T), a relation between the size of the error caused by quantum adiabatic approximation and the parameter T is given.
In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this computational error depends not only on the total computation time $T$ but also on the time derivatives of the adiabatic parameter $s(t)$ at the beginning and the end of evolution. Previous work (Phys. Rev. A \textbf{82}, 052305) also suggested this result. With six typical paths, we systematically demonstrate how to optimally design an adiabatic path to reduce th…
We examine the validity of the rotating wave approximation (RWA) in non-adiabatic holonomic single-qubit gates [New J. Phys. {\bf 14}, 103035 (2012)]. We demonstrate that the adoption of RWA may lead to a sharp decline in fidelity for rapid gate implementation and small energy separation between the excited and computational states. The validity of the RWA in the recent experimental realization [Nature (London) {\bf 496}, 482 (2013)] of non-adiabatic holonomic quantum computation for a superconducting qubit is examined.
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…
Adiabaticity of quantum evolution is important in many settings. One example is the adiabatic quantum computation. Nevertheless, up to now, there is no effective method to test the adiabaticity of the evolution when the eigenenergies of the driven Hamiltonian are not known. We propose a simple method to check adiabaticity of a quantum process for an arbitrary quantum system. We further propose a operational method for finding a uniformly adiabatic quench scheme based on Kibble-Zurek mechanism for the case when the initial and the final Hamiltonians are given. This method should help in impleme…
An alternative interpretation of the quantum adiabatic approximation is presented. This interpretation is based on the ideas originally advocated by David Bohm in his quest for establishing a hidden variable alternative to quantum mechanics. It indicates that the validity of the quantum adiabatic approximation is a sufficient condition for the separability of the quantum action function in the time variable. The implications of this interpretation for Berry's adiabatic phase and its semi-classical limit are also discussed.
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…
A non-adiabatic nuclear wavepacket dynamics simulation of the H$_2$O$^+$ de-excitation process is performed based on electronic structure calculations using the variational quantum eigensolver. The adiabatic potential energy surfaces and non-adiabatic coupling vectors are computed with algorithms for noisy intermediate-scale quantum devices, and time propagation is simulated with conventional methods for classical computers. The results of non-adiabatic transition dynamics from the $\tilde{B}$ state to $\tilde{A}$ state reproduce the trend reported in previous studies, which suggests that this…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H(λ)$ that is based on ground state quantum computation [1]. We treat both a 1-dimensional configuration in which qubits on a line undergo nearest neighbor 2-qubit gates and an all-to-all configuration in which every qubit undergoes 2-qubit gates with every other qubit in the system.
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest …
We extend the work of Hen for the Bernstein-Vazirani problem and Simon's problem on an adiabatic quantum computer. Our results are based on the Ising objective function for quantum annealing. For each problem we determine its objective function, describe its Hamiltonian matrix, and show the Hamiltonian matrix for a small problem. Following the pattern of Hen, we discuss factoring of integers, particularly Shor's factoring algorithm in an adiabatic quantum computing environment.
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic quantum computing, which accurately describes the evolution of the quantum state in a perturbative way, in which the adiabatic limit is the zeroth-order approximation. As an application of this formulation, non-adiabatic correction or error is estimated for several physical implementations of the adiabatic geometric gates. A quantum computing process consisti…
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 …
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground state. Some estimates/bounds are also given for the computational complexity of the algorithm with particular emphasis on the required energy resources, besides the space and time complexity, for the physical process of (quantum) computation in general.
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work proposes to execute some quantum learning protocols based entirely on adiabatic quantum evolution, hence dubbed as ``adiabatic quantum learning". In a conventional quantum machine learning protocol, the output is usually the expectation value of a pre-selected observable and the projective measurement of which forces a quantum circuit to run many times to obtain t…
We indicate that there are points to keep in mind in utilizing quantum states prepared by the adiabatic quantum computation. Even if an instantaneous expectation value of a physical quantity for the adiabatically prepared quantum state is close to an expectation value for the true vacuum, this does not assure us that the prepared vacuum is close to the true vacuum. In general time average of the expectation value tend to systematically differ from the true value. Using a simple model we discuss how to diminish this systematic difference.
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.
