A Probabilistic Approach to Quantum Inspired Algorithms
Shuvro Chowdhury, Supriyo Datta, Kerem Yunus Camsari · 2019
Digital computing is based on the notion of deterministic bits that are 0 or 1. At the other extreme, quantum computing is based on q-bits that are delicate, coherent superpositions of 0 and 1. In this paper, we describe an intermediate approach between these two extremes, namely Probabilistic Computing, based on the notion of probabilistic or p-bits that fluctuate between 0 and 1. Hardware p-bits can be compactly realized from emerging spintronic building blocks that are smaller, more energy efficient compared to their traditional CMOS implementations. Probabilistic circuits built out of interconnected p-bits can be useful for a host of quantum computing inspired algorithms.