During the last ten years, superconducting circuits have passed from being interesting
physical devices to becoming contenders for near-future useful and scalable quantum …

We provide Ising formulations for many NP-complete and NP-hard problems, including all of
Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model …

Realizing quantum speedup for practically relevant, computationally hard problems is a
central challenge in quantum information science. Using Rydberg atom arrays with up to …

Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic
exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide …

Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics
beyond the adiabatic criteria, where counterdiabatic (CD) driving provides a promising …

We provide here a brief perspective on the glass transition field. It is an assessment, written
from the point of view of theory, of where the field is and where it seems to be heading. We …

The many-body physics at quantum phase transitions shows a subtle interplay between
quantum and thermal fluctuations, emerging in the low-temperature limit. In this review, we …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

Meta-heuristic algorithms are problem-solving methods which try to find good-enough
solutions to very hard optimization problems, at a reasonable computation time, where …

Rich out-of-equilibrium collective dynamics of strongly interacting large assemblies emerge
in many areas of science. Some intriguing and not fully understood examples are the glassy …