Nav: Home

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

September 18, 2019

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.

The study, published in Nature on Wednesday (Sept. 18), introduces a device that serves as a basis for building probabilistic computers to more efficiently solve problems in areas such as drug research, encryption and cybersecurity, financial services, data analysis and supply chain logistics.

Today's computers store and use information in the form of zeroes and ones called bits. Quantum computers use qubits that can be both zero and one at the same time. In 2017, a Purdue research group led by Supriyo Datta, the university's Thomas Duncan Distinguished Professor of Electrical and Computer Engineering, proposed the idea of a probabilistic computer using 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. You might say that a p-bit is a 'poor man's qubit,'" Datta said.

Whereas qubits need really cold temperatures to operate, p-bits work at room temperature like today's electronics, so existing hardware could be adapted to build a probabilistic computer, the researchers say.

The team built a device that is a modified version of magnetoresistive random-access memory, or MRAM, which 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 William Borders, Shusuke Fukami and Hideo Ohno altered an MRAM device, making it intentionally unstable to better facilitate the ability of p-bits to fluctuate. Purdue researchers combined this 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 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 integer factorization. These calculations are well within the capabilities of today's classical computers, but the researchers believe that the probabilistic approach demonstrated in this paper would take up much less space and energy.

"On a chip, this circuit would take up the same area as a transistor, but perform a function that would have taken thousands of transistors to perform. It also operates in a manner that could speed up calculation through the parallel operation of a large number of p-bits," said Ahmed Zeeshan Pervaiz, a Ph.D. student in electrical and computer engineering at Purdue.

Realistically, hundreds of p-bits would be needed to solve bigger problems - but that's not too far off, the researchers say.

"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," said Kerem Camsari, a Purdue postdoctoral associate in electrical and computer engineering.
The Purdue group is associated with the Discovery Park Center for Computing Advances by Probabilistic Spin Logic led by Joerg Appenzeller. A patent application for this technology has been filed through the Purdue Research Foundation Office of Technology Commercialization.

The work was partially supported by the Defense Advanced Research Projects Agency; the Semiconductor Research Corp.; Japan's Council for Science, Technology and Innovation; the Japan Society for the Promotion of Science; and the Research Institute of Electrical Communication of Tohoku University.


Integer Factorization Using Stochastic Magnetic Tunnel Functions

William A. Borders1,8 , Ahmed Z. Pervaiz2,8 , Shunsuke Fukami1,3,4,5,6,7, Kerem Y. Camsari2, Hideo Ohno1,3,4,5,6,7, Supriyo Datta2

1 Laboratory for Nanoelectronics and Spintronics, Research Institute of Electrical Communication, Tohoku University, Sendai, Japan

2 School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA

3 Center for Spintronics Integrated Systems, Tohoku University, Sendai, Japan

4 Center for Innovative Integrated Electronic Systems, Tohoku University, Sendai, Japan

5 Center for Spintronics Research Network, Tohoku University, Sendai, Japan

6 Center for Science and Innovation in Spintronics (Core Research Cluster), Tohoku University, Sendai, Japan

7 WPI-Advanced Institute for Materials Research, Tohoku University, Sendai, Japan

DOI: 10.1038/s41586-019-1557-9

Conventional computers operate deterministically using strings of zeros and ones called bits to represent information in binary code. Despite the evolution of conventional computers into sophisticated machines, there are many classes of problems they cannot efficiently address, including inference, invertible logic, sampling, and optimization, leading to considerable interest in alternative computing schemes. Quantum computing, which uses qubits to represent a superposition of O and I, can perform these tasks efficiently. However, decoherence and the current requirement for cryogenic operation, as well as the limited many-body interactions that can be implemented, pose considerable challenges. Probabilistic computing is another unconventional computation scheme that shares similar concepts with quantum computing but is not limited by the above challenges. The key role is played by a probabilistic bit-a p-bit-a robust, classical entity fluctuating in time between 0 and I, which interacts with other p-bits in the same system using principles inspired by neural networks. Here we present a proof-of-concept experiment for probabilistic computing using spintronics technology, and demonstrate integer factorization, an illustrative example of the optimization class of problems addressed by adiabatic and gated quantum computing. Nanoscale magnetic tunnel junctions showing stochastic behaviour are developed by modifying market-ready magnetoresistive random access memory technology and are used to implement three-terminal p-bits that operate at room temperature. The p-bits are electrically connected to form a functional asynchronous network, to which a modified adiabatic quantum computing algorithm that implements three­ and four-body interactions is applied. Factorization of integers up to 945 is demonstrated with this rudimentary asynchronous probabilistic computer using eight correlated p-bits and the results show good agreement with theoretical predictions, thus providing a potentially scalable hardware approach to the difficult problems of optimization and sampling.

Purdue University

Related Quantum Computers Articles:

Blanket of light may give better quantum computers
Researchers from DTU Physics describe in an article in Science, how--by simple means -- they have created a 'carpet' of thousands of quantum-mechanically entangled light pulses.
One step closer future to quantum computers
Physicists at Uppsala University in Sweden have identified how to distinguish between true and 'fake' Majorana states in one of the most commonly used experimental setups, by means of supercurrent measurements.
Dartmouth research advances noise cancelling for quantum computers
The characterization of complex noise in quantum computers is a critical step toward making the systems more precise.
Spreading light over quantum computers
Scientists at Linköping University have shown how a quantum computer really works and have managed to simulate quantum computer properties in a classical computer.
Newfound superconductor material could be the 'silicon of quantum computers'
Newly discovered properties in the compound uranium ditelluride show that it could prove highly resistant to one of the nemeses of quantum computer development -- the difficulty with making such a computer's memory storage switches, called qubits, function long enough to finish a computation before losing the delicate physical relationship that allows them to operate as a group.
Quantum computers to clarify the connection between the quantum and classical worlds
Los Alamos National Laboratory scientists have developed a new quantum computing algorithm that offers a clearer understanding of the quantum-to-classical transition, which could help model systems on the cusp of quantum and classical worlds, such as biological proteins, and also resolve questions about how quantum mechanics applies to large-scale objects.
The best of both worlds: how to solve real problems on modern quantum computers
Researchers at the US Department of Energy's (DOE) Argonne National Laboratory and Los Alamos National Laboratory, along with researchers at Clemson University and Fujitsu Laboratories of America, have developed hybrid algorithms to run on size-limited quantum machines and have demonstrated them for practical applications.
A new theory for trapping light particles aims to advance development of quantum computers
Researchers have developed a new protocol for ensuring the stability of data when photons are stored for extended periods of time.
Improving quantum computers
For decades, experts have predicted that quantum computers will someday perform difficult tasks, such as simulating complex chemical systems, that can't be done by conventional computers.
A new hope of quantum computers for factorizations of RSA with a thousand-fold excess
Universal quantum computers are still in its infancy that cannot achieve practical applications (code-cracking) in near term.
More Quantum Computers News and Quantum Computers Current Events

Top Science Podcasts

We have hand picked the top science podcasts of 2019.
Now Playing: TED Radio Hour

Why do we revere risk-takers, even when their actions terrify us? Why are some better at taking risks than others? This hour, TED speakers explore the alluring, dangerous, and calculated sides of risk. Guests include professional rock climber Alex Honnold, economist Mariana Mazzucato, psychology researcher Kashfia Rahman, structural engineer and bridge designer Ian Firth, and risk intelligence expert Dylan Evans.
Now Playing: Science for the People

#540 Specialize? Or Generalize?
Ever been called a "jack of all trades, master of none"? The world loves to elevate specialists, people who drill deep into a single topic. Those people are great. But there's a place for generalists too, argues David Epstein. Jacks of all trades are often more successful than specialists. And he's got science to back it up. We talk with Epstein about his latest book, "Range: Why Generalists Triumph in a Specialized World".
Now Playing: Radiolab

Dolly Parton's America: Neon Moss
Today on Radiolab, we're bringing you the fourth episode of Jad's special series, Dolly Parton's America. In this episode, Jad goes back up the mountain to visit Dolly's actual Tennessee mountain home, where she tells stories about her first trips out of the holler. Back on the mountaintop, standing under the rain by the Little Pigeon River, the trip triggers memories of Jad's first visit to his father's childhood home, and opens the gateway to dizzying stories of music and migration. Support Radiolab today at