A Scalable CMOS Ising Computer Featuring Sparse and Reconfigurable Spin Interconnects for Solving Combinatorial Optimization Problems

No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard problems. Alternatively, Ising computer based on the Ising model and annealing process has recently drawn significant attention. The Ising compu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE journal of solid-state circuits Ročník 57; číslo 3; s. 858 - 868
Hlavní autori: Su, Yuqi, Mu, Junjie, Kim, Hyunjoon, Kim, Bongjin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:0018-9200, 1558-173X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard problems. Alternatively, Ising computer based on the Ising model and annealing process has recently drawn significant attention. The Ising computers can find approximate solutions to the NP-hard COPs by observing the convergence of dynamic spin states. However, they have encountered challenges in mapping the optimization problems to the inflexible Ising computers with fixed spin interconnects. In this article, we propose a scalable CMOS Ising computer with sparse and reconfigurable spin interconnects for arbitrary mapping of spin networks with minimal overhead. Without a mapping algorithm, the proposed Ising computer provides a method for directly mapping COPs to the reconfigurable hardware. A 65-nm CMOS Ising test chip with 252 spins is fabricated and used for solving COPs, including max-cut problems.
AbstractList No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard problems. Alternatively, Ising computer based on the Ising model and annealing process has recently drawn significant attention. The Ising computers can find approximate solutions to the NP-hard COPs by observing the convergence of dynamic spin states. However, they have encountered challenges in mapping the optimization problems to the inflexible Ising computers with fixed spin interconnects. In this article, we propose a scalable CMOS Ising computer with sparse and reconfigurable spin interconnects for arbitrary mapping of spin networks with minimal overhead. Without a mapping algorithm, the proposed Ising computer provides a method for directly mapping COPs to the reconfigurable hardware. A 65-nm CMOS Ising test chip with 252 spins is fabricated and used for solving COPs, including max-cut problems.
Author Kim, Hyunjoon
Mu, Junjie
Kim, Bongjin
Su, Yuqi
Author_xml – sequence: 1
  givenname: Yuqi
  orcidid: 0000-0002-9696-3906
  surname: Su
  fullname: Su, Yuqi
  email: yuqi003@e.ntu.edu.sg
  organization: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
– sequence: 2
  givenname: Junjie
  orcidid: 0000-0002-6496-6539
  surname: Mu
  fullname: Mu, Junjie
  email: junjie003@e.ntu.edu.sg
  organization: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
– sequence: 3
  givenname: Hyunjoon
  orcidid: 0000-0001-9906-073X
  surname: Kim
  fullname: Kim, Hyunjoon
  email: kimh0003@e.ntu.edu.sg
  organization: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
– sequence: 4
  givenname: Bongjin
  orcidid: 0000-0001-5397-9628
  surname: Kim
  fullname: Kim, Bongjin
  email: bongjin@ucsb.edu
  organization: Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA, USA
BookMark eNp9kE9r3DAQxUVJoZukH6D0IujZW_2xLOkYTNNuSNlQJ9CbkbWjoOCVXEkutPd-73izSw899DTM4_3eDO8cnYUYAKF3lKwpJfrjTde1a0YYW3NaM6WbV2hFhVAVlfz7GVoRQlWlGSFv0HnOT8ta14qu0J8r3FkzmmEE3H7ddniTfXjEbdxPc4GEr8GUOR2kbjIpAzZhh7-BjcH5xzm9cN3kA96Exb7IAWzJ2MWEuzj-PGUNPpgSkzcj3k7F7_1vU3wM-C7FJWCfL9FrZ8YMb0_zAj1cf7pvv1S328-b9uq2slzoUkkugLmdFoS7nYKBW8edNLJumNFU8EGCE1JIvmMwCKWspUM9wGApk42yNb9AH465U4o_Zsilf4pzCsvJnjWcaqFEzRaXPLpsijkncL315eXhkowfe0r6Q-f9ofP-0Hl_6nwh6T_klPzepF__Zd4fGQ8Af_260UQ2gj8DbYKRMA
CODEN IJSCBC
CitedBy_id crossref_primary_10_1109_TCSII_2023_3249763
crossref_primary_10_1109_TCSI_2024_3523999
crossref_primary_10_1109_TNANO_2024_3457533
crossref_primary_10_1109_JXCDC_2023_3256981
crossref_primary_10_1063_5_0216656
crossref_primary_10_1109_JSAC_2024_3431579
crossref_primary_10_1109_JSSC_2023_3318586
crossref_primary_10_1002_adpr_202400004
crossref_primary_10_1038_s41598_023_49559_3
crossref_primary_10_1109_JSSC_2023_3236376
crossref_primary_10_1109_JSSC_2024_3352907
crossref_primary_10_1103_PhysRevE_111_044211
crossref_primary_10_1109_ACCESS_2025_3553542
crossref_primary_10_1109_MNANO_2024_3378483
crossref_primary_10_1038_s41928_024_01228_7
crossref_primary_10_1016_j_micpro_2022_104674
crossref_primary_10_1109_ACCESS_2025_3568069
crossref_primary_10_1109_TCSII_2024_3380609
crossref_primary_10_1016_j_mejo_2025_106621
crossref_primary_10_1109_TCSI_2023_3263923
Cites_doi 10.23919/VLSICircuits52068.2021.9492453
10.1007/s11128-008-0082-9
10.1007/s00500-020-05502-6
10.1109/JSSC.2015.2498601
10.15803/ijnc.7.2_154
10.1038/nature13570
10.48550/arXiv.1811.11538
10.1016/j.micpro.2020.103251
10.1126/science.aah5178
10.1007/s11128-018-1863-4
10.1038/s41928-022-00774-2
10.1007/s11128-010-0200-3
10.1006/jctb.1995.1006
10.48550/arXiv.1406.2741
10.1109/DAC18072.2020.9218695
10.1038/nature10012
10.1109/VLSICircuits18222.2020.9162869
10.1109/JSSC.2020.3027702
10.1109/ISSCC19947.2020.9062938
10.1145/3149526.3149532
10.1038/srep16213
10.1126/science.aah4243
10.1109/JSSC.2019.2949230
10.1038/ncomms15785
10.1109/CICC51472.2021.9431401
10.3389/fphy.2014.00005
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/JSSC.2022.3142896
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore Digital Library
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-173X
EndPage 868
ExternalDocumentID 10_1109_JSSC_2022_3142896
9690765
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
41~
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PZZ
RIA
RIE
RNS
TAE
TN5
UKR
VH1
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c359t-735e2fd9503fd8eb3cf3f7a7462a9153b7ef57573d2eb588cc1b4bebc12768c43
IEDL.DBID RIE
ISICitedReferencesCount 30
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000750287400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9200
IngestDate Mon Jun 30 10:25:07 EDT 2025
Tue Nov 18 20:55:38 EST 2025
Sat Nov 29 02:50:23 EST 2025
Wed Aug 27 02:49:35 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c359t-735e2fd9503fd8eb3cf3f7a7462a9153b7ef57573d2eb588cc1b4bebc12768c43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6496-6539
0000-0001-5397-9628
0000-0002-9696-3906
0000-0001-9906-073X
PQID 2631958542
PQPubID 85482
PageCount 11
ParticipantIDs ieee_primary_9690765
crossref_citationtrail_10_1109_JSSC_2022_3142896
crossref_primary_10_1109_JSSC_2022_3142896
proquest_journals_2631958542
PublicationCentury 2000
PublicationDate 2022-03-01
PublicationDateYYYYMMDD 2022-03-01
PublicationDate_xml – month: 03
  year: 2022
  text: 2022-03-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE journal of solid-state circuits
PublicationTitleAbbrev JSSC
PublicationYear 2022
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref30
ref11
ref10
ref2
ref1
ref16
ref19
ref18
Takemoto (ref17)
ref24
ref23
Diestel (ref5) 2005
ref26
ref25
ref20
ref22
ref21
Parekh (ref7) 2016
ref28
ref27
ref29
ref8
ref9
ref3
ref6
Neven (ref4) 2008
References_xml – ident: ref18
  doi: 10.23919/VLSICircuits52068.2021.9492453
– ident: ref11
  doi: 10.1007/s11128-008-0082-9
– start-page: 64
  volume-title: IEEE ISSCC Dig. Tech. Papers
  ident: ref17
  article-title: 4.6 A 144Kb annealing system composed of $9\times16$ Kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems
– year: 2016
  ident: ref7
  article-title: Benchmarking adiabatic quantum optimization for complex network analysis
  publication-title: arXiv:1604.00319
– ident: ref8
  doi: 10.1007/s00500-020-05502-6
– ident: ref14
  doi: 10.1109/JSSC.2015.2498601
– ident: ref27
  doi: 10.15803/ijnc.7.2_154
– ident: ref1
  doi: 10.1038/nature13570
– ident: ref3
  doi: 10.48550/arXiv.1811.11538
– ident: ref24
  doi: 10.1016/j.micpro.2020.103251
– ident: ref21
  doi: 10.1126/science.aah5178
– ident: ref10
  doi: 10.1007/s11128-018-1863-4
– ident: ref25
  doi: 10.1038/s41928-022-00774-2
– ident: ref12
  doi: 10.1007/s11128-010-0200-3
– volume-title: Graph Theory
  year: 2005
  ident: ref5
– ident: ref9
  doi: 10.1006/jctb.1995.1006
– ident: ref6
  doi: 10.48550/arXiv.1406.2741
– ident: ref30
  doi: 10.1109/DAC18072.2020.9218695
– ident: ref13
  doi: 10.1038/nature10012
– ident: ref19
  doi: 10.1109/VLSICircuits18222.2020.9162869
– ident: ref20
  doi: 10.1109/JSSC.2020.3027702
– ident: ref16
  doi: 10.1109/ISSCC19947.2020.9062938
– ident: ref29
  doi: 10.1145/3149526.3149532
– ident: ref26
  doi: 10.1038/srep16213
– ident: ref23
  doi: 10.1126/science.aah4243
– ident: ref15
  doi: 10.1109/JSSC.2019.2949230
– ident: ref22
  doi: 10.1038/ncomms15785
– ident: ref28
  doi: 10.1109/CICC51472.2021.9431401
– year: 2008
  ident: ref4
  article-title: Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
  publication-title: arXiv:0804.4457
– ident: ref2
  doi: 10.3389/fphy.2014.00005
SSID ssj0014481
Score 2.5130267
Snippet No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 858
SubjectTerms Algorithms
Annealing
Annealing processor
CMOS
Combinatorial analysis
combinatorial optimization problems (COPs)
Computational modeling
Couplers
Exact solutions
Hardware
Integrated circuit interconnections
Interconnections
Ising computer
Ising model
Lattices
Mapping
minor embedding
Optimization
Polynomials
Qubit
Reconfigurable hardware
sparse and reconfigurable interconnects
Spin dynamics
Title A Scalable CMOS Ising Computer Featuring Sparse and Reconfigurable Spin Interconnects for Solving Combinatorial Optimization Problems
URI https://ieeexplore.ieee.org/document/9690765
https://www.proquest.com/docview/2631958542
Volume 57
WOSCitedRecordID wos000750287400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore Digital Library
  customDbUrl:
  eissn: 1558-173X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014481
  issn: 0018-9200
  databaseCode: RIE
  dateStart: 19660101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS-wwFA4qblz4Fuder2ThSqw2Sds0SxkUFV9QBXelecmAtzPMw3_g_77npJlB8CK46yKnLXwnOedLcr5DyBFDzSzwg0SnvkkgXjdJ0xQ6sZnyJs8AFxsk82_l_X358qIel8jJohbGORcun7lTfAxn-XZoZrhVdqaQyhX5MlmWUna1WosTA6AZXXc8BhMYPhFPMFmqzm6qqg9MkHMgqJBtoz7_pxgUmqp8WYlDeLnc-NmPbZL1mEbS8w73LbLk2m2y9klccId8nNMKAMDSKNq_e6joNW4L0HkbB4rJX6hRpNUI2K2jTWspstHWD15n42BXjQYtDZuGBi_EmOmEQpJLq-Hbe3wXEGuk7eDF9AFWn7-xrJM-do1qJrvk-fLiqX-VxKYLiRG5miZS5I57q_JUeFsC1TZeeNnIrOCNguVRS-chxZPCcqfzsjSG6Uw7bRgH5mIysUdW2mHr9gllrNBeQn5ntc5smelGCe-dU0AhdSpMj6RzGGoTFcmxMcZbHZhJqmpErkbk6ohcjxwvTEadHMd3g3cQqsXAiFKPHMyxruOEndS8ECi7A9756_9Wv5HRc4ZXRTg7ICvT8cz9IavmfTqYjA-DL_4DaejeIA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB7xqER7gLa0YlugPvRUkZLEzsNHtCoCuixIoRK3KH6hlWh2tQ_-Af-7M453hQSqxC0HPyJ9Y3s-e-YbgO8JaWahHUQqdk2E53UTNU2uIiOk05lAXIyXzB8Uw2F5eyuv1-BolQtjrfXBZ_Ynffq3fDPWC7oqO5ZE5fJsHTYzIdKky9ZavRkg0ejq4yW4hHGS8IaZxPL4oqr6yAXTFCkq-tuk0P_kFPJlVZ7txf6AOd153a-9h-3gSLKTDvkPsGbbj_DuibzgLjyesAohoOQo1r-8qtg5XQywZSEHRu6fz1Jk1QT5rWVNaxjx0daN7hZT36-ajFrmrw01hcTo-Yyhm8uq8f1DGAupNRF3tGN2hfvP35DYya67UjWzT_Dn9NdN_ywKZRcizTM5jwqe2dQZmcXcmRLJtnbcFU0h8rSRuEGqwjp08gpuUquystQ6UUJZpZMUuYsW_DNstOPW7gFLkly5Aj08o5QwpVCN5M5ZK5FEqpjrHsRLGGodNMmpNMZ97blJLGtCribk6oBcD36sukw6QY7_Nd4lqFYNA0o92F9iXYclO6vTnJPwDtrnl5d7fYOts5vLQT04H_7-Cm9pni4YbR825tOFPYA3-mE-mk0PvV3-AxpL4WI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Scalable+CMOS+Ising+Computer+Featuring+Sparse+and+Reconfigurable+Spin+Interconnects+for+Solving+Combinatorial+Optimization+Problems&rft.jtitle=IEEE+journal+of+solid-state+circuits&rft.au=Su%2C+Yuqi&rft.au=Mu%2C+Junjie&rft.au=Kim%2C+Hyunjoon&rft.au=Kim%2C+Bongjin&rft.date=2022-03-01&rft.pub=IEEE&rft.issn=0018-9200&rft.volume=57&rft.issue=3&rft.spage=858&rft.epage=868&rft_id=info:doi/10.1109%2FJSSC.2022.3142896&rft.externalDocID=9690765
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9200&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9200&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9200&client=summon