CAPSL Probabilistic Spin Logic for Low-Energy Boolean and Non-Boolean Computing

Recent News

‘Poor man’s qubit’ can solve quantum problems without going quantum

September 19, 2019

Researchers demonstrate the first hardware for a ‘probabilistic computer’ WEST LAFAYETTE, Ind. — It may still be decades before quantum computers are ready to solve problems that today’s classical computers aren’t fast or efficient enough to solve, but the emerging “probabilistic computer” could bridge the gap between classical and quantum computing. Engineers at Purdue University and Tohoku University in Japan have built the first hardware to demonstrate how the fundamental units of what would be a probabilistic computer – called p-bits – are capable of performing a calculation that quantum computers would usually be called upon to perform.

‘Poor man’s qubit’ can solve quantum problems without going quantum

p-bit based Classification Architecture Recognized at ACM GLSVLSI Conference

May 29, 2018

May 24, 2018: The research article titled “Low-Energy Deep Belief Networks using Intrinsic Sigmoidal Spintronic-based Probabilistic Neurons” was recognized as the runner-up for Best Paper of Conference at the 28th ACM Great Lakes Symposium on VLSI (GLSVLSI). In this work, CAPSL team members from UCF, Purdue, and UMN developed a Probabilistic Spin Logic (PSL) based “p-bit” device approach for evaluating sigmoidal activation functions using a crossbar architecture. The results were presented during GLSVLSI Technical Session #1 on “Emerging Computing and Post-CMOS Technologies.”

Read More about "p-bit based Classification Architecture Recognized at ACM GLSVLSI Conference"