A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms

Abstract

The transistor celebrated its 75${}^{\text{th}}$ birthday in 2022. The continued scaling of the transistor defined by Moore's Law continues, albeit at a slower pace. Meanwhile, computing demands and energy consumption required by modern artificial intelligence (AI) algorithms have skyrocketed. As an alternative to scaling transistors for general-purpose computing, the integration of transistors with unconventional technologies has emerged as a promising path for domain-specific computing. In this article, we provide a full-stack review of probabilistic computing with p-bits as a representative example of the energy-efficient and domain-specific computing movement. We argue that p-bits could be used to build energy-efficient probabilistic systems, tailored for probabilistic algorithms and applications. From hardware, architecture, and algorithmic perspectives, we outline the main applications of probabilistic computers ranging from probabilistic machine learning and AI to combinatorial optimization and quantum simulation. Combining emerging nanodevices with the existing CMOS ecosystem will lead to probabilistic computers with orders of magnitude improvements in energy efficiency and probabilistic sampling, potentially unlocking previously unexplored regimes for powerful probabilistic algorithms.

References in corpus (16)

• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A Critical Review of Recent Progress on Negative Capacitance Field-Effect Transistors
• Intrinsic optimization using stochastic nanomagnets
• Machine learning meets quantum physics
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Demonstration of nanosecond operation in stochastic magnetic tunnel junctions
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Machine learning technique to find quantum many-body ground states of bosons on a lattice
• Probabilistic computing with p-bits
• Low Barrier Magnet Design for Efficient Hardware Binary Stochastic Neurons
• Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering
• Efficient Probabilistic Computing with Stochastic Perovskite Nickelates
• Adaptive Parallel Tempering for Stochastic Maximum Likelihood Learning of RBMs
• A Spin Hall Ising Machine
• Constructing Dynamical Systems to Model Higher Order Ising Spin Interactions and their Application in Solving Combinatorial Optimization Problems