arrow
Return

Coherent SAT solvers: a tutorial

delete2023-06-02
delete4
PRE
AI
S
Sam Reifenstein *
T
Timothée Leleu
T
Timothy P. McKenna
M
Marc Jankowski
M
Myoung‐Gyun Suh
E
Edwin Ng
F
Farad Khoyratee
Z
Zoltán Toroczkai
Y
Y. Yamamoto
DOI:10.1364/AOP.475823delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The coherent Ising machine (CIM) is designed to solve the NP-hard Ising problem quickly and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are classes of NP-complete and NP-hard problems that are equally important and more practically relevant combinatorial optimization problems. Many approaches exist for solving Boolean SAT, such as quantum annealing and classical stochastic local search (SLS) solvers; however, they all are expected to require many steps to solve hard SAT problems and, thus, require large amounts of time and energy. In addition, a SAT problem can be converted into an Ising problem and solved by an Ising machine; however, we have found that this approach has drawbacks. As well as reviewing exist-ing approaches to solving the SAT problem, we have extended the CIM algorithm and architecture to solve SAT and Max-SAT problems directly. This new technique is termed a coherent SAT solver (CSS). We have studied three implementations of the CSS, all-optical, hybrid optical-digital and all digital (cyber-CSS), and have compared the time-to-solution and energy-to-solution of three machines. The cyber-CSS, which is already implemented using a graphics processing unit (GPU), demonstrates competitive performance against existing SLS solvers such as probSAT. The CSS is also compared with another continuous-time SAT solver known as the CTDS, and the scaling behavior is evaluated for random 3-SAT problems. The hybrid optical-digital CSS is a more per -formant and practical machine that can be realized in a short term. Finally, the all-optical CSS promises the best energy-to-solution cost; however various technical challenges in nonlinear optics await us in order to build this machine. (c) 2023 Optica Publishing Group
Keywords:
ISING MACHINE
OPTIMIZATION
NETWORK

Journal

Advances in Optics and Photonics cover
Advances in Optics and Photonics
IF:
23.8
Papers:
205
Citations:
4.9K

Organization

U
University of Tokyo
Scholars:
7.1W
Papers: 6.5W
Citations: 2.2K
U
University of Notre Dame
Scholars:
1.2W
Papers: 1.1W
Citations: 1.7W
Cited Papers

Cited Papers

Microparticles induce multifactorial resistance through oncogenic pathways independently of cancer cell type
err2014-12-15
err0
errOAAI
errPaloma Silva de Souza; André L.S. Cruz; João P.B. Viola; Raquel C. Maia
errShare
errSave
[8] Animal models for meningitis
err1994-01-01
err0
PREAI
errMartin G. Tauber; André Zwahlen
errShare
errSave
The Chaos Within Sudoku
err2012-10-11
err37
errOAAI
errErcsey-Ravasz, Maria; Toroczkai, Zoltan
errShare
errSave
Temporal cavity solitons in one-dimensional Kerr media as bits in an all-optical buffer
err2010-05-23
err595
PREAI
errLeo, Francois; Coen, Stephane; Kockaert, Pascal; Gorza, Simon-Pierre; Emplit, Philippe; Haelterman, Marc
errShare
errSave
Phytosterol Contents of Edible Oils and Their Contributions to Estimated Phytosterol Intake in the Chinese Diet
err2019-08-09
err0
errOAAI
errRuinan Yang; Li Xue; Liangxiao Zhang; Xuefang Wang; Xin Qi; Jun Jiang; Li Yu; Xiupin Wang; Wen Zhang; Qi Zhang; Peiwu Li
errShare
errSave
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
err2014-10-26
err404
PREAI
errMarandi, Alireza; Wang, Zhe; Takata, Kenta; Byer, Robert L.; Yamamoto, Yoshihisa
errShare
errSave
All-Optical Scalable Spatial Coherent Ising Machine
err2021-11-10
err22
errOAAI
errStrinati, Marcello Calvanese; Pierangeli, Davide; Conti, Claudio
errShare
errSave
researcher View more