Detailed Information

Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems

Cited 0 time in Web of Science Cited 0 time in Scopus

Si, Jia; Yang, Shuhan; Cen, Yunuo; Chen, Jiaer; Huang, Yingna; Yao, Zhaoyang; Kim, Dong-Jun; Cai, Kaiming; Yoo, Jerald; Fong, Xuanyao; Yang, Hyunsoo

Issue Date
Nature Publishing Group
Nature Communications, Vol.15 No.1
The growth of artificial intelligence leads to a computational burden in solving non-deterministic polynomial-time (NP)-hard problems. The Ising computer, which aims to solve NP-hard problems faces challenges such as high power consumption and limited scalability. Here, we experimentally present an Ising annealing computer based on 80 superparamagnetic tunnel junctions (SMTJs) with all-to-all connections, which solves a 70-city traveling salesman problem (TSP, 4761-node Ising problem). By taking advantage of the intrinsic randomness of SMTJs, implementing global annealing scheme, and using efficient algorithm, our SMTJ-based Ising annealer outperforms other Ising schemes in terms of power consumption and energy efficiency. Additionally, our approach provides a promising way to solve complex problems with limited hardware resources. Moreover, we propose a cross-bar array architecture for scalable integration using conventional magnetic random-access memories. Our results demonstrate that the SMTJ-based Ising computer with high energy efficiency, speed, and scalability is a strong candidate for future unconventional computing schemes.
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Related Researcher

Yoo, Jerald Image

Yoo, Jerald유담
  • College of Engineering
  • Department of Electrical and Computer Engineering
Research Area Biomedical Applications, Energy-Efficient Integrated Circuits


Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.