A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing
Authors:
Top Cited Papers
- 9 December 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 51 (1) , 303-309
Abstract
In the near future, the ability to solve combinatorial optimization problems will be a key technique to enable the IoT era. A new computing architecture called Ising computing and implemented using CMOS circuits is proposed. This computing maps the problems to an Ising model, a model to express the behavior of magnetic spins, and solves combinatorial optimization problems efficiently exploiting its intrinsic convergence properties. In the computing, “CMOS annealing” is used to find a better solution for the problems. A 20k-spin prototype Ising chip is fabricated in 65 nm process. The Ising chip achieves 100 MHz operation and its capability of solving combinatorial optimization problems using an Ising model is confirmed. The power efficiency of the chip can be estimated to be 1800 times higher than that of a general purpose CPU when running an approximation algorithm.Keywords
This publication has 9 references indexed in Scilit:
- The brain chipScience, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Spatial computing architecture using randomness of memory cell stability under voltage control2013
- Quantum annealing with manufactured spinsNature, 2011
- On greedy construction heuristics for the MAX-CUT problemInternational Journal of Computational Science and Engineering, 2007
- Matching properties of MOS transistorsIEEE Journal of Solid-State Circuits, 1989
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- Static-noise margin analysis of MOS SRAM cellsIEEE Journal of Solid-State Circuits, 1987
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982