GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling
arXiv:2601.14476 · doi:10.1038/s41598-025-90520-3
Abstract
Probabilistic computing using probabilistic bits (p-bits) presents an efficient alternative to traditional CMOS logic for complex problem-solving, including simulated annealing and machine learning. Realizing p-bits with emerging devices such as magnetic tunnel junctions (MTJs) introduces device variability, which was expected to negatively impact computational performance. However, this study reveals an unexpected finding: device variability can not only degrade but also enhance algorithm performance, particularly by leveraging timing variability. This paper introduces a GPU-accelerated, open-source simulated annealing framework based on p-bits that models key device variability factors -- timing, intensity, and offset -- to reflect real-world device behavior. Through CUDA-based simulations, our approach achieves a two-order magnitude speedup over CPU implementations on the MAX-CUT benchmark with problem sizes ranging from 800 to 20,000 nodes. By providing a scalable and accessible tool, this framework aims to advance research in probabilistic computing, enabling optimization applications in diverse fields.
14 pages
References in corpus (21)
- Quantum Annealing in the Transverse Ising Model
- Quantum annealing with more than one hundred qubits
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- p-Bits for Probabilistic Spin Logic
- Massively Parallel Probabilistic Computing with Sparse Ising Machines
- GPGPU Processing in CUDA Architecture
- Demonstration of nanosecond operation in stochastic magnetic tunnel junctions
- Hardware emulation of stochastic p-bits for invertible logic
- Hardware-aware Boltzmann machine learning using stochastic magnetic tunnel junctions
- Weighted p-bits for FPGA implementation of probabilistic circuits
- Efficient CMOS Invertible Logic Using Stochastic Computing
- Autonomous Probabilistic Coprocessing with Petaflips per Second
- Experimental quantum annealing: case study involving the graph isomorphism problem
- Experimental demonstration of an integrated on-chip p-bit core utilizing stochastic Magnetic Tunnel Junctions and 2D-MoS2 FETs
- Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering
- Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing
- Enhanced Convergence in p-bit Based Simulated Annealing with Partial Deactivation for Large-Scale Combinatorial Optimization Problems
- Physics-inspired Ising Computing with Ring Oscillator Activated p-bits
- Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing
- Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems