A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

Ising machines are hardware solvers that aim to find the absolute or approximate ground
states of the Ising model. The Ising model is of fundamental computational interest because …

The aim of this review is to provide quantum engineers with an introductory guide to the
central concepts and challenges in the rapidly accelerating field of superconducting …

Superconducting qubits are leading candidates in the race to build a quantum computer
capable of realizing computations beyond the reach of modern supercomputers. The …

Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …

Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to
solve combinatorial optimization problems. In recent years, advances in quantum …

In the past 20 years, impressive progress has been made both experimentally and
theoretically in superconducting quantum circuits, which provide a platform for manipulating …

Faster algorithms for combinatorial optimization could prove transformative for diverse areas
such as logistics, finance and machine learning. Accordingly, the possibility of quantum …

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

Experiments on disordered alloys,–suggest that spin glasses can be brought into low-
energy states faster by annealing quantum fluctuations than by conventional thermal …