250 magnetic tunnel junctions-based probabilistic Ising machine
Top Cited Papers
Open Access
- 17 April 2026
- journal article
- research article
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Abstract
In combinatorial optimization, probabilistic Ising machines have gained significant attention for their acceleration of Monte-Carlo sampling with the potential to reduce time-to-solution in finding approximate ground states. However, to be viable in real applications, further advances in scalability and energy efficiency are necessary. Here, we experimentally demonstrate a scalable probabilistic Ising machine based on 250 spin-transfer-torque magnetic tunnel junctions. Our computing approach integrates spintronic tunable true random number generators with advanced annealing techniques. For sparsely connected graphs, the proposed massive parallel architecture enables a cluster parallel update method that overcomes the serial limitations of Gibbs sampling, leading to a 10 times acceleration without hardware changes. Furthermore, we prove experimentally that the simulated quantum annealing boosts solution quality 20 times over conventional simulated annealing while also increasing robustness to device variability. In addition, we propose a next generation chiplet-based architecture for future large-scale, high-performance, and energy-efficient unconventional computing hardware.Keywords
All Related Versions
Funding Information
- National Research Foundation Singapore (NRF-000214-00)
- Ministry of Education - Singapore (T2EP50123-0025)
This publication has 50 references indexed in Scilit:
- Record acceleration of the two-dimensional Ising model using a high-performance wafer-scale engineComputer Physics Communications, 2025
- Fully CMOS‐Based p‐Bits with a Bistable Resistor for Probabilistic ComputingAdvanced Functional Materials, 2024
- Efficient Probabilistic Computing with Stochastic Perovskite NickelatesNano Letters, 2022
- Controllable SiOx Nanorod Memristive Neuron for Probabilistic Bayesian InferenceAdvanced Materials, 2021
- Solution-Processed Carbon Nanotube True Random Number GeneratorNano Letters, 2017
- The Maximum Cut Problem2013
- Quantum annealing with manufactured spinsNature, 2011
- Allocating hard real-time tasks: An NP-Hard problem made easyReal-Time Systems, 1992
- Simulated annealing1987
- Graph Theory with Applications1976