Publications
Detailed Information
Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Si, Jia | - |
dc.contributor.author | Yang, Shuhan | - |
dc.contributor.author | Cen, Yunuo | - |
dc.contributor.author | Chen, Jiaer | - |
dc.contributor.author | Huang, Yingna | - |
dc.contributor.author | Yao, Zhaoyang | - |
dc.contributor.author | Kim, Dong-Jun | - |
dc.contributor.author | Cai, Kaiming | - |
dc.contributor.author | Yoo, Jerald | - |
dc.contributor.author | Fong, Xuanyao | - |
dc.contributor.author | Yang, Hyunsoo | - |
dc.date.accessioned | 2024-05-08T01:04:18Z | - |
dc.date.available | 2024-05-08T01:04:18Z | - |
dc.date.created | 2024-05-03 | - |
dc.date.created | 2024-05-03 | - |
dc.date.issued | 2024-04 | - |
dc.identifier.citation | Nature Communications, Vol.15 No.1 | - |
dc.identifier.uri | https://hdl.handle.net/10371/201061 | - |
dc.description.abstract | 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. | - |
dc.language | 영어 | - |
dc.publisher | Nature Publishing Group | - |
dc.title | Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems | - |
dc.type | Article | - |
dc.identifier.doi | 10.1038/s41467-024-47818-z | - |
dc.citation.journaltitle | Nature Communications | - |
dc.identifier.wosid | 001217093700030 | - |
dc.identifier.scopusid | 2-s2.0-85191299343 | - |
dc.citation.number | 1 | - |
dc.citation.volume | 15 | - |
dc.description.isOpenAccess | Y | - |
dc.contributor.affiliatedAuthor | Yoo, Jerald | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Related Researcher
- College of Engineering
- Department of Electrical and Computer Engineering
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.