.png){kind=icon}
.png){kind=icon}
Return
Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel Tempering
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevApplied.17.024052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The search for hardware-compatible strategies for solving nondeterministic polynomial time (NP)-hard combinatorial optimization problems (COPs) is an important challenge of today's computing research because of their wide range of applications in real-world optimization problems. Here, we introduce an unconventional scalable approach to face maximum-satisfiability (MAX-SAT) problems that combines probabilistic computing with p-bits, parallel tempering, and the concept of invertible logic gates. We theoretically show the spintronic implementation of this approach based on a coupled set of LandauLifshitz-Gilbert equations, showing a potential path for energy efficient and very fast (p-bits exhibiting nanosecond timescale switching) architecture for the solution of COPs. The algorithm is benchmarked with hard MAX-SAT instances from the 2016 MAX-SAT competition (e.g., HG-4SAT-V150-C13501.cnf, which can be described with 2851 p-bits), including weighted MAX-SAT and maximum-cut problems.
Keywords:
OPTIMIZATION
Journal
IF:
4.4
Papers:
7.1K
Citations:
2.8W
View more organizations