The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators
Open accessAbstract
Combinatorial optimization problems belong to the non-deterministic polynomial time (NP)-hard complexity class, and their computational requirements scale exponentially with problem size. They can be mapped into the problem of finding the ground state of an Ising model, which describes a physical system with converging dynamics. Various platforms, including optical, electronic and quantum approaches, have been explored to accelerate the ground-state search, but improvements in energy efficiencies and computational abilities are still required. Here we report an Ising solver based on a network of electrically coupled phase-transition nano-oscillators (PTNOs) that form a continuous-time dynamical system (CTDS). The bi-stable phases of the injection-locked PTNOs act as artificial Ising spins and the stable points of the CTDS act as the ground-state solution of the problem. We experimentally show that a prototype with eight PTNOs can solve an NP-hard MaxCut problem with high probability of success (96% for 600 annealing cycles). We also show via numerical simulations that our Ising Hamiltonian solver can solve MaxCut problems of 100 nodes with energy efficiency of 1.3 × 107 solutions per second per watt, offering advantages over other approaches including memristor-based Hopfield networks, quantum annealers and photonic Ising solvers. An Ising solver that is based on a network of electrically coupled phase-transition nano-oscillators, which provides a continuous-time dynamical system, can be used to efficiently solve a non-deterministic polynomial time (NP)-hard MaxCut problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
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
Emergent complex neural dynamics
Chialvo, D. R. (2010) · Nature Physics · doi:10.1038/nphys1803 · Cited by 1,165
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
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
Metadata
- Authors
- Dutta, S., Khanna, A., Assoa, A. S., Paik, H., Schlom, D. G., Toroczkai, Z., Raychowdhury, A., & Datta, S.
- Venue
- Nature Electronics
- Published
- 2021-07-26
- Volume
- 4
- Issue
- 7
- Pages
- 502-512
- ISSN
- 2520-1131 (ISSN-L)
- OpenAlex
- W3184554868
- Cited by
- 171
- References
- 6
- FWCI
- 12.92
- Type
- journal article
- Language
- en
- Open access
- green
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: An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators. https://app.cochat.ai/papers/10.1038/s41928-021-00616-7
- The paper
- Dutta, S., Khanna, A., Assoa, A. S., Paik, H., Schlom, D. G., Toroczkai, Z., Raychowdhury, A., & Datta, S. (2021). An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators. Nature Electronics. https://doi.org/10.1038/s41928-021-00616-7
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.