Integer factorization using stochastic magnetic tunnel junctions

William A. Borders, Ahmed Z. Pervaiz, Shunsuke Fukami (), Kerem Y. Camsari (), Hideo Ohno and Supriyo Datta
Additional contact information
William A. Borders: Tohoku University
Ahmed Z. Pervaiz: Purdue University
Shunsuke Fukami: Tohoku University
Kerem Y. Camsari: Purdue University
Hideo Ohno: Tohoku University
Supriyo Datta: Purdue University

Nature, 2019, vol. 573, issue 7774, 390-393

Abstract: Abstract 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 that 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 0 and 1, is expected to perform these tasks efficiently1–3. However, decoherence and the current requirement for cryogenic operation4, as well as the limited many-body interactions that can be implemented, pose considerable challenges. Probabilistic computing1,5–7 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 1, which interacts with other p-bits in the same system using principles inspired by neural networks8. 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 adiabatic9 and gated2 quantum computing. Nanoscale magnetic tunnel junctions showing stochastic behaviour are developed by modifying market-ready magnetoresistive random-access memory technology10,11 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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
https://www.nature.com/articles/s41586-019-1557-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:573:y:2019:i:7774:d:10.1038_s41586-019-1557-9

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/s41586-019-1557-9

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().