# A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach

arXiv: https://arxiv.org/abs/2402.00065 · HTML: https://mlsanity.com/paper/2402.00065/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 14 references that are in the map.
- First posted on arXiv 29 Jan 2024.

## Builds on (most cited first, 1 of 1)

- [A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation](https://mlsanity.com/paper/2308.03344/) (2023)

## Abstract (arXiv)

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.