Unconventional Computing Using Ising Accelerators
Recent advancements in tackling complex computational problems have focused on drawing inspiration from nature. One notable example is the use of Ising machines to solve nondeterministic polynomial-time hard combinatorial optimization problems.
Authors
- Jaydeep P. Kulkarni (ORCID: https://orcid.org/0000-0002-0258-6776)
- Chieh-Pu Lo (ORCID: https://orcid.org/0000-0002-3413-8708)
- Shanshan Xie (ORCID: https://orcid.org/0000-0001-8411-3050)
- Siddhartha Raman Sundara Raman (ORCID: https://orcid.org/0000-0002-3563-8560)
Institutions
- The University of Texas at Austin (US)
Publication Details
- Journal
- Computer
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/mc.2025.3544798
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00