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 …

Physical Ising machines rely on nature to guide a dynamical system towards an optimal
state which can be read out as a heuristical solution to a combinatorial optimization problem …

A promising approach to achieve computational supremacy over the classical von Neumann
architecture explores classical and quantum hardware as Ising machines. The minimisation …

Ising machines are hardware devices that can solve ground-state search problems of Ising
spin models and could be of use in solving various practical combinatorial optimization …

Many combinatorial optimization problems can be mapped to finding the ground states of
the corresponding Ising Hamiltonians. The physical systems that can solve optimization …

Finding the ground state of an Ising model maps to certain classes of combinatorial
optimization problems. Currently, several physical systems, called Ising machines, are being …

Combinatorial optimization problems belong to the non-deterministic polynomial time (NP)-
hard complexity class, and their computational requirements scale exponentially with …

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 …

Ising machines based on analog systems have the potential to accelerate the solution of
ubiquitous combinatorial optimization problems. Although some artificial spins to support …

In the near future, the performance growth of Neumann-architecture computers will slow
down due to the end of semiconductor scaling. Presently a new computing paradigm, so …