A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach
Gerard Fleury, Philippe Lacomme

TL;DR
This paper introduces a compact quantum approach inspired by QAOA for solving large 3-SAT problems, demonstrating successful resolution of instances with 91 clauses and 20 variables using a minimal circuit.
Contribution
It presents a novel, efficient quantum method for 3-SAT resolution that models solution ranks directly, enabling large problem instances to be tackled with fewer quantum gates.
Findings
Successfully solved 91-clauses, 20-variables 3-SAT instances
Developed a highly compact quantum circuit with few gates
Validated approach using Qiskit simulations
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Scheduling and Optimization Algorithms · Formal Methods in Verification
