Physics-inspired Ising Computing with Ring Oscillator Activated p-bits

Abstract

The nearing end of Moore's Law has been driving the development of domain-specific hardware tailored to solve a special set of problems. Along these lines, probabilistic computing with inherently stochastic building blocks (p-bits) have shown significant promise, particularly in the context of hard optimization and statistical sampling problems. p-bits have been proposed and demonstrated in different hardware substrates ranging from small-scale stochastic magnetic tunnel junctions (sMTJs) in asynchronous architectures to large-scale CMOS in synchronous architectures. Here, we design and implement a truly asynchronous and medium-scale p-computer (with $\approx$ 800 p-bits) that closely emulates the asynchronous dynamics of sMTJs in Field Programmable Gate Arrays (FPGAs). Using hard instances of the planted Ising glass problem on the Chimera lattice, we evaluate the performance of the asynchronous architecture against an ideal, synchronous design that performs parallelized (chromatic) exact Gibbs sampling. We find that despite the lack of any careful synchronization, the asynchronous design achieves parallelism with comparable algorithmic scaling in the ideal, carefully tuned and parallelized synchronous design. Our results highlight the promise of massively scaled p-computers with millions of free-running p-bits made out of nanoscale building blocks such as stochastic magnetic tunnel junctions.

To appear in the 22nd IEEE International Conference on Nanotechnology (IEEE-NANO 2022)

References in corpus (4)

• Massively Parallel Probabilistic Computing with Sparse Ising Machines
• Demonstration of nanosecond operation in stochastic magnetic tunnel junctions
• Efficient CMOS Invertible Logic Using Stochastic Computing
• Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering

Cited by in corpus (5)

• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
• Enhanced Convergence in p-bit Based Simulated Annealing with Partial Deactivation for Large-Scale Combinatorial Optimization Problems
• Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
• GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling
• Ground-State Probabilistic Logic with the Simplest Binary Energy Landscape for Probabilistic Computing