A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach
This is an incremental improvement for quantum computing applications in solving combinatorial problems like 3-SAT.
The paper tackled the 3-SAT problem by using a QAOA-like approach to model solution ranks, resulting in a compact circuit that solved instances with 91 clauses and 20 variables using Qiskit.
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.