The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Intrinsic optimization using stochastic nanomagnets
Open accessAbstract
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets.
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Memristive devices for computing
Yang, J. J., Strukov, D. B., & Stewart, D. R. (2013) · Nature Nanotechnology · doi:10.1038/nnano.2012.240 · Cited by 3,885
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
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
Quantum simulation of frustrated Ising spins with trapped ions
Kim, K., Chang, M.-S., Korenblit, S., Islam, R., Edwards, E. E., Freericks, J. K., Lin, G.-D., Duan, L.-M., & Monroe, C. (2010) · Nature · doi:10.1038/nature09071 · Cited by 750 · cited 1×
“Many diverse systems have been proposed to solve NP-hard optimization problems such as those based on simulated annealing [2], DNA[3, 4], quantum annealing [5, 6], Cellular Neural Networks [7–9], CMOS [10], trapped ions [11], electromechanics [12], optics [13–20], and magnets [21–23].”
BackgroundFinding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
Cited by
Grollier, J., Querlioz, D., Camsari, K. Y., Everschor-Sitte, K., Fukami, S., & Stiles, M. D. (2020) · Nature Electronics · doi:10.1038/s41928-019-0360-9 · Cited by 975
Self-citationIsing 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
Stochastic p -Bits for Invertible Logic
Camsari, K. Y., Faria, R., Sutton, B. M., & Datta, S. (2017) · Physical Review X · doi:10.1103/physrevx.7.031014 · Cited by 360
Self-citationLarge-Scale Photonic Ising Machine by Spatial Light Modulation
Pierangeli, D., Marcucci, G., & Conti, C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.213902 · Cited by 347
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
Metadata
- Authors
- Sutton, B., Camsari, K. Y., Behin-Aein, B., & Datta, S.
- Venue
- Scientific Reports
- Published
- 2017-03-15
- Volume
- 7
- Issue
- 1
- Pages
- 44370-44370
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2534684513
- Cited by
- 226
- References
- 7
- FWCI
- 11.19
- Type
- journal article
- Language
- en
- Open access
- gold
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: Intrinsic optimization using stochastic nanomagnets. https://app.cochat.ai/papers/10.1038/srep44370
- The paper
- Sutton, B., Camsari, K. Y., Behin-Aein, B., & Datta, S. (2017). Intrinsic optimization using stochastic nanomagnets. Scientific Reports. https://doi.org/10.1038/srep44370
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.