In this review, after providing the basic physical concept behind quantum annealing (or
adiabatic quantum computation), we present an overview of some recent theoretical as well …

Shortcuts to adiabaticity (STA) are fast routes to the final results of slow, adiabatic changes
of the controlling parameters of a system. The shortcuts are designed by a set of analytical …

Quantum annealing is a computing paradigm that has the ambitious goal of efficiently
solving large-scale combinatorial optimization problems of practical importance. However …

We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum
computing. To suppress diabatic transitions, we include counterdiabatic driving in the …

The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-
classical algorithm that solves combinatorial optimization problems. While there is evidence …

Shortcuts to adiabaticity provide fast protocols for quantum state preparation in which the
use of auxiliary counterdiabatic controls circumvents the requirement of slow driving in …

Quantum computers promise to solve certain computational problems much faster than
classical computers. However, current quantum processors are limited by their modest size …

We propose a hybrid classical-quantum digitized counterdiabatic algorithm to tackle the
protein-folding problem on a tetrahedral lattice. Digitized counterdiabatic quantum …

One of the most widely known building blocks of modern physics is Heisenberg's
indeterminacy principle. Among the different statements of this fundamental property of the …

The quantum approximate optimization algorithm (QAOA) has proved to be an effective
classical-quantum algorithm serving multiple purposes, from solving combinatorial …