Quantangle-SAT: A Quantum SAT Solver Based on Entanglement and Equivalence Checking
Abstract
Satisfiability (SAT) is a central problem in computer science, and advances in SAT-solving algorithms have a far-reaching impact across many fields. Recent works have proposed quantum SAT solvers based on Grover's algorithm, a quantum search technique. However, Grover-based approaches face a key limitation: they typically require prior knowledge of the number of satisfying assignments of the target Boolean formula. This information is unavailable in most practical settings. Quantum counting can be used to estimate this quantity, but it incurs a computational overhead that is several orders of magnitude higher than Grover search. In this paper, we propose a novel quantum SAT solver based on entanglement and equivalence checking. Our method does not assume prior knowledge of the number of solutions and is computationally more efficient than quantum counting. Although the worst case time complexity is inevitably exponential, we prove that the expected time complexity of our approach is only constant time O(1) over random Boolean functions. Experimental results also support our theoretical claim.
Cite
@article{arxiv.2604.18218,
title = {Quantangle-SAT: A Quantum SAT Solver Based on Entanglement and Equivalence Checking},
author = {Shang-Wei Lin and Ji-Qing Yan and Yean-Ru Chen and Zhe Hou and David Sanán},
journal= {arXiv preprint arXiv:2604.18218},
year = {2026}
}