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

The recent success in quantum annealing, ie, optimization of the cost or energy functions of
complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced …

A quantum system will stay near its instantaneous ground state if the Hamiltonian that
governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of …

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 …

Our world, of course, changed in many other ways as well since the publication of the first
edition. The global pandemic impacted all areas of society and will probably transform how …

We propose a class of qubit networks that admit the perfect state transfer of any quantum
state in a fixed period of time. Unlike many other schemes for quantum computation and …

Quantum walks provide a framework for designing quantum algorithms that is both intuitive
and universal. To leverage the computational power of these walks, it is important to be able …

Quantum algorithms use the principles of quantum mechanics, such as, for example,
quantum superposition, in order to solve particular problems outperforming standard …

Grover's quantum search algorithm provides a way to speed up combinatorial search, but is
not directly applicable to searching a physical database. Nevertheless, Aaronson and …

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 …