pbits for Probabilistic Spin Logic (PSL): A Brief Introduction
Category
Published on
Abstract
Digital electronics is based on stable bits that can have one of two values, 0 and 1. At the other extreme we have quantum computing using using qbits that can be in superposition states that are 0 and 1 at the same time. In our recent work we have introduced a concept that is intermediate between bits and qbits, namely a probabilistic bit or pbit that fluctuates randomly between 0 and 1.
TALKS

This talk provides a 10minute introduction by Prof. Datta.

An extended 50minute version of this talk can be viewed here.

An hourlong tutorial lecture by Dr. Kerem Camsari can be viewed here.

SLIDES FROM A RECENT TALK

REVIEW ARTICLE

 K.Y. Camsari, B.M.Sutton and S.Datta “pBits for Probabilistic Spin Logic,” https://arxiv.org/abs/1809.04028

TWO RECENT HIGHLIGHTS


Emulating qubits using pbits


K.Y. Camsari, S. Chowdhury and S.Datta “Scaled Quantum Circuits Emulated with Room Temperature pBits,” https://arxiv.org/abs/1810.07144


FPGA implementation of pbits


A.Z.Pervaiz, L.A.Ghantasala, B.M.Sutton and K.Y. Camsari “Weighted pbits for FPGA implementation of probabilistic circuits,” IEEE Transactions on Neural Networks and Learning Systems, arxiv.org/abs/1712.04166.

OTHER RELATED PUBLICATIONS

RELATED nCORE CENTER
Cite this work
Researchers should cite this work as follows:
Time
Location
Purdue University, West Lafayette, IN