Adiabatic quantum computing (AQC) started as an approach to solving optimization
problems and has evolved into an important universal alternative to the standard circuit …

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 …

Understanding NP-complete problems is a central topic in computer science (NP stands for
nondeterministic polynomial time). This is why adiabatic quantum optimization has attracted …

Quantum computing (QC) is anticipated to provide a speedup over classical approaches for
specific problems in optimization, simulation, and machine learning. With the advances in …

We propose and analyze the use of Bayesian optimization techniques to design quantum
annealing schedules with minimal user and resource requirements. We showcase our …

Adiabatic quantum computation (AQC) is a universal model for quantum computation which
seeks to transform the initial ground state of a quantum system into a final ground state …

We investigate the connection between local minima in the problem Hamiltonian and first-
order quantum phase transitions during adiabatic quantum computation. We demonstrate …

We determine the complexity of several constraint satisfaction problems using the quantum
adiabatic algorithm in its simplest implementation. We do so by studying the size …

In this review we consider the performance of the quantum adiabatic algorithm for the
solution of decision problems. We divide the possible failure mechanisms into two sets …

The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to
find the minimum of a classical cost function whose domain has size N. We show that poor …