ArticleNature communications2024
Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems.
Article in Nature communications, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 18 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
18 citing papers in PubMed.
- Hardware-Native Gaussian Sampling With Probabilistic Ising Machines for Modern Communication Paradigms.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026Article
- Hardware Acceleration of Stochastic Neural Networks Enabled by Bit-Cell Level Co-Design of Magnetic Tunnel Junctions.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026Article
- Applied spintronics: From spin transport to spin-charge interconversion and emerging devices.Science advances · 2026Review
- Field-Free Spin-Splitting-Torque Driven Stochastic Neuron Mimicking the Neuromorphic Imagination for High-Performance Recognition.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026Article
- Integration of Reconfigurable p-Bit and 1R Crossbar Array for Memristive Probabilistic Computing.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026Article
- 250 magnetic tunnel junctions-based probabilistic Ising machine.Nature communications · 2026Article
- Intrinsic annealing in a hybrid memristor-magnetic tunnel junction Ising machine.Nature communications · 2026Article
- A unified performance-cost landscape of parallel p-bit Ising machines based on update dynamics.Scientific reports · 2026Article
- A parallel magnetic tunnel junction-based probabilistic Ising processor for efficient quadratic optimization.Nature communications · 2026Article
- Metrics for spin-based computing.Nature reviews. Physics · 2026Article
- Quantum-Inspired Fast Algorithm and Circuit Realization for Constrained Combinatorial Optimization Problem.Research (Washington, D.C.) · 2026Article
- A hardware demonstration of a universal programmable RRAM-based probabilistic computer for molecular docking.Nature communications · 2025Article
- Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem.Nature communications · 2025Article
- Perpendicular-anisotropy artificial spin ice with spontaneous ordering: a platform for reservoir computing with flexible timescales.Communications engineering · 2025Article
- Superior probabilistic computing using operationally stable probabilistic-bit constructed by a manganite nanowire.National science review · 2025Article
- Finding independent sets in large-scale graphs with a coherent Ising machine.Science advances · 2025Article
- Automatic Extraction and Compensation of P-Bit Device Variations in Large Array Utilizing Boltzmann Machine Training.Micromachines · 2025Article
- CMOS plus stochastic nanomagnets enabling heterogeneous computers for probabilistic inference and learning.Nature communications · 2024Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
11 authors.
Funding
Abstract
The growth of artificial intelligence leads to a computational burden in solving non-deterministic polynomial-time (NP)-hard problems. The Ising computer, which aims to solve NP-hard problems faces challenges such as high power consumption and limited scalability. Here, we experimentally present an Ising annealing computer based on 80 superparamagnetic tunnel junctions (SMTJs) with all-to-all connections, which solves a 70-city traveling salesman problem (TSP, 4761-node Ising problem). By taking advantage of the intrinsic randomness of SMTJs, implementing global annealing scheme, and using efficient algorithm, our SMTJ-based Ising annealer outperforms other Ising schemes in terms of power consumption and energy efficiency. Additionally, our approach provides a promising way to solve complex problems with limited hardware resources. Moreover, we propose a cross-bar array architecture for scalable integration using conventional magnetic random-access memories. Our results demonstrate that the SMTJ-based Ising computer with high energy efficiency, speed, and scalability is a strong candidate for future unconventional computing schemes.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.