.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
OPTIMIZATION
期刊
IF:
4.4
论文数:
7.1K
被引数:
2.8W
机构
引用论文
The “ART” of Linkage: Pre-Treatment Loss to Care after HIV Diagnosis at Two PEPFAR Sites in Durban, South Africa联系的 “艺术”: 在南非德班的两个PEPFAR地点，艾滋病毒诊断后的治疗前损失到护理.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Neurodevelopmental outcomes after congenital heart surgery and strategies for improvement先天性心脏手术后的神经发育结果和改善策略
PREAI
分享收藏分享收藏Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏
查看更多内容