Probabilistic Computing with NbOx Mott Memristor-based Self-oscillatory pbit
Preprint
- 9 June 2023
- preprint
- Published by Springer Nature in Research Square
Abstract
Energy-based computing is a promising approach for solving NP-hard problems. Probabilistic computing using pbits, which can be fabricated through the semiconductor process and integrated with conventional processing units, can be an efficient candidate for fulfilling these demands. Here, we propose a novel pbit unit comprising a NbOx mott memristor-based oscillator, capable of generating probabilistic bits in a self-clocking manner. The noise-induced mott transition causes the probabilistic behavior, which can be effectively modeled using a multi-noise-induced stochastic process around the mott transition temperature. We demonstrate a memristive Boltzmann machine based on our proposed pbit and validate its feasibility by solving NP-hard problems. Furthermore, we propose a streamlined operation methodology that considers the autocorrelation of individual bits, enabling energy-efficient high-performance probabilistic computing.Keywords
All Related Versions
- Version 1, 2023-06-09, Research Square
- Published version: Nature Communications, 14 (1), 1.
This publication has 29 references indexed in Scilit:
- Intrinsic optimization using stochastic nanomagnetsScientific Reports, 2017
- An accurate locally active memristor model for S-type negative differential resistance in NbOxApplied Physics Letters, 2016
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Memristor, Hodgkin–Huxley, and Edge of ChaosNanotechnology, 2013
- Noise-induced escape in an excitable systemPhysical Review E, 2013
- Sub-100 fJ and sub-nanosecond thermally driven threshold switching in niobium oxide crosspoint nanodevicesNanotechnology, 2012
- LOCAL ACTIVITY IS THE ORIGIN OF COMPLEXITYInternational Journal of Bifurcation and Chaos, 2005
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972