Ising machines as hardware solvers of combinatorial optimization problems

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 any problem in the complexity class NP can be formulated as an Ising problem with only polynomial overhead, and thus a scalable Ising machine that outperforms existing standard digital computers could have a huge impact for practical applications. We survey the status of various approaches to constructing Ising machines and explain their underlying operational principles. The types of Ising machines considered here include classical thermal annealers based on technologies such as spintronics, optics, memristors and digital hardware accelerators; dynamical systems solvers implemented with optics and electronics; and superconducting-circuit quantum annealers. We compare and contrast their performance using standard metrics such as the ground-state success probability and time-to-solution, give their scaling relations with problem size, and discuss their strengths and weaknesses. Minimizing the energy of the Ising model is a prototypical combinatorial optimization problem, ubiquitous in our increasingly automated world. This Review surveys Ising machines - special-purpose hardware solvers for this problem - and examines the various operating principles and compares their performance.

Automated summary

Ising machines are hardware solvers for finding the ground states of the Ising model. They are of great interest in computational complexity as they can solve any problem in the NP class with polynomial overhead. This review surveys the different approaches to constructing Ising machines and compares their performance, discussing their strengths and weaknesses.