This paper addresses the resolution of the 3-SAT problem using a QAOA-like approach. The chosen principle involves modeling the solution ranks of the 3-SAT problem, which, in this particular case, directly represent a solution. This results in a highly compact circuit with few gates, enabling the modeling of large-sized 3-SAT problems. Numerical experimentation demonstrates that the approach can solve instances composed of 91 clauses and 20 variables with an implementation based on Qiskit.
@article{arxiv.2402.00065,
title = {A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach},
author = {Gerard Fleury and Philippe Lacomme},
journal= {arXiv preprint arXiv:2402.00065},
year = {2024}
}