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 …

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 …

Computers based on physical systems are increasingly anticipated to overcome the
impending limitations on digital computer performance. One such computer is a coherent …

Combinatorial optimization problems are pervasive across science and industry. Modern
deep learning tools are poised to solve these problems at unprecedented scales, but a …

The analysis and optimization of complex systems can be reduced to mathematical
problems collectively known as combinatorial optimization. Many such problems can be …

Unconventional, special-purpose machines may aid in accelerating the solution of some of
the hardest problems in computing, such as large-scale combinatorial optimizations, by …

Combinatorial optimization problems are ubiquitous but difficult to solve. Hardware devices
for these problems have recently been developed by various approaches, including …

Quickly obtaining optimal solutions of combinatorial optimization problems has tremendous
value but is extremely difficult. Thus, various kinds of machines specially designed for …

By applying a microwave drive to a specially designed Josephson circuit, we have realized
a double-well model system: a Kerr oscillator submitted to a squeezing force. We have …

Physical annealing systems provide heuristic approaches to solving combinatorial
optimization problems. Here, we benchmark two types of annealing machines—a quantum …