Probabilistic computing demonstration promises 'poor man's qubit'

October 02, 2019 //By Rich Pell
Probabilistic computing demonstration promises 'poor man's qubit'
Engineers at Purdue University (West Lafayette, IN) and Tohoku University in Japan say they have built the first hardware to demonstrate how "p-bits" – the fundamental units of what would be a probabilistic computer – are capable of performing a calculation that would typically require a quantum computer.

An emerging computing technology, "probabilistic computers" are seen as a possible bridge between the gap of classical and quantum computing. The researchers' demonstration presents a device that serves as a basis for building probabilistic computers that could more efficiently solve problems in areas such as drug research, encryption and cybersecurity, financial services, data analysis, and supply chain logistics.

While today's computers store and use information in the form of zeros and ones (called bits) and quantum computers use qubits that can be both zero and one at the same time, a probabilistic computer uses "p-bits" that can be either zero or one at any given time and fluctuate rapidly between the two.

"There is a useful subset of problems solvable with qubits that can also be solved with p-bits," says Supriyo Datta, the university’s Thomas Duncan Distinguished Professor of Electrical and Computer Engineering. "You might say that a p-bit is a 'poor man’s qubit.'"

While qubits need extremely cold temperatures in which to operate, p-bits - like today's electronics - work at room temperature, so existing hardware could be adapted to build a probabilistic computer, say the researchers. Following on this idea, the engineers built a device that is a modified version of magnetoresistive random-access memory - or MRAM - that some types of computers use today to store information. The technology uses the orientation of magnets to create states of resistance corresponding to zero or one.

Tohoku University researchers altered an MRAM device making it intentionally unstable to better facilitate the ability of p-bits to fluctuate, while the Purdue researchers combined the device with a transistor to build a three-terminal unit whose fluctuations could be controlled. Eight such p-bit units were interconnected to build a probabilistic computer.

The circuit, say the researchers, successfully solved what is often considered a "quantum" problem: breaking down, or factoring, numbers such as 35,161 and 945 into smaller numbers - a calculation known as


Vous êtes certain ?

Si vous désactivez les cookies, vous ne pouvez plus naviguer sur le site.

Vous allez être rediriger vers Google.