Related papers: Obstructions To Classically Simulating The Quantum…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
All known examples confirming the possibility of an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (AQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric…
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…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
The system undergoes adiabatic evolution when its population in the instantaneous eigenbasis of its time-dependent Hamiltonian changes only negligibly. Realization of such dynamics requires slow-enough changes of the parameters of the…
We have studied numerically the evolution of an adiabatic quantum computer in the presence of a Markovian ohmic environment by considering Ising spin glass systems with up to 20 qubits independently coupled to this environment via two…
Given quantum hardware that enables sampling from a family of natively implemented Hamiltonians, how well can one use that hardware to sample from a Hamiltonian outside that family? A common approach is to minor embed the desired…
We introduce the adiabatic quantum Monte Carlo (AQMC) method, where we gradually crank up the interaction strength, as an amelioration of the sign problem. It is motivated by the adiabatic theorem and will approach the true ground-state if…
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
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…
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental…
We revisit the complex time method for the application to quantum dynamics as an exceptional point is encircled in the parameter space of the Hamiltonian. The basic idea of the complex time method is using complex contour integration to…
Adiabatic quantum computing~(AQC) is based on the adiabatic principle, where a quantum system remains in an instantaneous eigenstate of the driving Hamiltonian. The final state of the Hamiltonian encodes solution to the problem of interest.…
We consider the time-dependent transverse field Ising chain with time-periodic perturbations. Without perturbations, this model is one of the famous models that obeys the scaling in the adiabatic limit predicted by the quantum Kibble-Zurek…
Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
The theoretical analysis of the Adiabatic Quantum Computation protocol presents several challenges resulting from the difficulty of simulating, with classical resources, the unitary dynamics of a large quantum device. We present here a…