Among various algorithms designed to exploit the specific properties of quantum computers
with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to …

To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by
Google Inc.[VS Denchev, Phys. Rev. X 6, 031015 (2016) 10.1103/PhysRevX. 6.031015] …

The model of adiabatic quantum computation is a relatively recent model of quantum
computation that has attracted attention in the physics and computer science communities …

The quantum adiabatic approximation has a long history, going back to Born and Fock 1
early in the development of quantum theory. Recently, the realization that the adiabatic …

Efforts to develop useful quantum computers have been blocked primarily by environmental
noise. Quantum annealing is a scheme of quantum computation that is predicted to be more …

A superconducting chip containing a regular array of flux qubits, tunable interqubit inductive
couplers, an XY-addressable readout system, on-chip programmable magnetic memory …

Quantum algorithms could be much faster than classical ones in solving the factoring
problem. Adiabatic quantum computation for this is an alternative approach other than …

Recent experiments with increasingly larger numbers of qubits have sparked renewed
interest in adiabatic quantum computation, and in particular quantum annealing. A central …

Quantum walks can be considered as a generalized version of the classical random walk.
There are two classes of quantum walks, that is, the discrete-time (or coined) and the …

We analyze the performance of adiabatic quantum computation (AQC) subject to
decoherence. To this end, we introduce an inherently open-systems approach, based on a …