The most popular and comprehensive Open Source ECM platform
Let us know more
Probabilistic Computers: A Poor Man’s Quantum Computer
Classic computers operate on binary data — data stored as either a ‘0’ or a ‘1’. Quantum computers operate on what is called a qubit, a value that is a probabilistic combination of the two states of ‘0’ and ‘1’. When qubits are placed side by side, a quantum phenomenon occurs called ‘entanglement‘.
Researchers are building primitive quantum computers based on qubits now, but it is expected that it will be some time before quantum computing is able to perform useful results.
Until quantum computing becomes viable, another approach researchers are considering is creating a computer that simulates the probabilistic states of quantum qubits. The approach is called probabilistic computing and it uses a basic element called the p-bit, which like the qubit is able to take on probabilistic values of the states ‘0’ and ‘1’.
Supriyo Datta, a professor at Purdue, said that “classically, probabilities can only be positive numbers. qubits, on the other hand, seem to be governed by probabilities that can be negative or even complex numbers. But there is a useful subset of problems solvable with qubits that can also be solved with p-bits. You might say that a p-bit is a ‘poor man’s qubit.’” Probabilistic computing, in effect, is a method to solve a subclass of quantum problems without ‘going quantum’.
Probabilistic computing might be viewed as a stepping stone to quantum computing. By starting to learn how to attack and solve problems probabilistically now, we will be directly able to apply that knowledge to the quantum computers of the future.
Kerem Camsari, assistant professor at UCSB, said that “in the near future p-bits could better help a machine to learn like a human does or optimize a route for goods to travel to market.”
