QuBRIM

Zhang, Yiqiao; Vengalam, Uday Kumar Reddy; Sharma, Anshujit; Huang, Michael C.; Ignjatović, Željko

doi:10.1145/3508352.3549443

Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design 2022

DOI: 10.1145/3508352.3549443

|View full text |Cite

QuBRIM

Yiqiao Zhang

Uday Kumar Reddy Vengalam

Anshujit Sharma

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Augmenting an electronic Ising machine to effectively solve boolean satisfiability

Sharma,

Burns,

Hahn

et al. 2023

Sci Rep

View full text Add to dashboard Cite

With the slowdown of improvement in conventional von Neumann systems, increasing attention is paid to novel paradigms such as Ising machines. They have very different approach to solving combinatorial optimization problems. Ising machines have shown great potential in solving binary optimization problems like MaxCut. In this paper, we present an analysis of these systems in boolean satisfiability (SAT) problems. We demonstrate that, in the case of 3-SAT, a basic architecture fails to produce meaningful acceleration, largely due to the relentless progress made in conventional SAT solvers. Nevertheless, careful analysis attributes part of the failure to the lack of two important components: cubic interactions and efficient randomization heuristics. To overcome these limitations, we add proper architectural support for cubic interaction on a state-of-the-art Ising machine. More importantly, we propose a novel semantic-aware annealing schedule that makes the search-space navigation much more efficient than existing annealing heuristics. Using numerical simulations, we show that such an “Augmented” Ising Machine for SAT is projected to outperform state-of-the-art software-based, GPU-based and conventional hardware SAT solvers by orders of magnitude.

show abstract

Augmenting an electronic Ising machine to effectively solve boolean satisfiability

Sharma,

Burns,

Hahn

et al. 2023

Sci Rep

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

QuBRIM

Cited by 1 publication

References 16 publications

Augmenting an electronic Ising machine to effectively solve boolean satisfiability

Augmenting an electronic Ising machine to effectively solve boolean satisfiability

Contact Info

Product

Resources

About