The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Matching properties of MOS transistors
Pelgrom, M. J. M., Duinmaijer, A. C. J., & Welbers, A. P. G. (1989) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1989.572629 · Cited by 3,319
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Static-noise margin analysis of MOS SRAM cells
Seevinck, E., List, F. J., & Lohstroh, J. (1987) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1987.1052809 · Cited by 1,436
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Barahona, F., Grötschel, M., Jünger, M., & Reinelt, G. (1988) · Operations Research · doi:10.1287/opre.36.3.493 · Cited by 504
24.3 20k-spin Ising chip for combinational optimization problem with CMOS annealing
Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., & Mizuno, H. (2015) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc.2015.7063111 · Cited by 114
Service, R. F. (2014) · Science · doi:10.1126/science.345.6197.614 · Cited by 70
On greedy construction heuristics for the MAX-CUT problem
Kahruman‐Anderoglu, S., Kolotoğlu, E., Butenko, S. I., & Hicks, I. V. (2007) · International Journal of Computational Science and Engineering · doi:10.1504/ijcse.2007.017827 · Cited by 64
Cited by
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Goto, H., Tatsumura, K., & Dixon, A. R. (2019) · Science Advances · doi:10.1126/sciadv.aav2372 · Cited by 405
100,000-spin coherent Ising machine
Honjo, T., Sonobe, T., Inaba, K., Inagaki, T., Ikuta, T., Yamada, Y., Kazama, T., Enbutsu, K., Umeki, T., Kasahara, R., et al. (2021) · Science Advances · doi:10.1126/sciadv.abh0952 · Cited by 341
High-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Designing metamaterials with quantum annealing and factorization machines
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013319 · Cited by 181
Metadata
- Venue
- IEEE Journal of Solid-State Circuits
- Published
- 2016-01
- Volume
- 51
- Issue
- 1
- Pages
- 303-309
- ISSN
- 0018-9200 (ISSN-L)
- 1558-173X
- OpenAlex
- W2197817604
- Cited by
- 368
- References
- 11
- FWCI
- 8.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing. https://app.cochat.ai/papers/10.1109/jssc.2015.2498601
- The paper
- A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing. (2016). IEEE Journal of Solid-State Circuits. https://doi.org/10.1109/jssc.2015.2498601
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.