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

From phys.org

'Poor man's qubit' can solve quantum problems without going quantum

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.

Read more…