Related papers: Modeling an adiabatic quantum computer
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
Gate-based quantum computers can in principle simulate the adiabatic dynamics of a large class of Hamiltonians. Here we consider the cyclic adiabatic evolution of a parameter in the Hamiltonian. We propose a quantum algorithm to estimate…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved…
The escape rate \Gamma of the large-spin model described by the Hamiltonian H = -DS_z^2 - H_zS_z - H_xS_x is investigated with the help of the mapping onto a particle moving in a double-well potential U(x). The transition-state method…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are…
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…
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
We study a simple system described by a 2x2 Hamiltonian and the evolution of the quantum states under the influence of a perturbation. More precisely, when the initial Hamiltonian is not degenerate,we check analytically the validity of the…
We present a new quantum adiabatic theorem that allows one to rigorously bound the adiabatic timescale for a variety of systems, including those described by unbounded Hamiltonians. Our bound is geared towards the qubit approximation of…
We consider an inhomogeneous quantum phase transition across a multicritical point of the XY quantum spin chain. This is an example of a Lifshitz transition with a dynamical exponent z = 2. Just like in the case z = 1 considered in New J.…
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
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.,…
Adiabatic time evolution of quantum systems is a widely used tool with applications ranging from state preparation through simplifications of computations and topological transformations to optimization and quantum computing. Adiabatic time…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…