← Back ◌ Quantum Computing Apr 14, 2026

A parallel and distributed fixed-point quantum search algorithm for solving SAT problems

arXiv Quantum Archived Apr 14, 2026 ✓ Full text saved

arXiv:2604.09980v1 Announce Type: new Abstract: Boolean satisfiability (SAT) problem is of fundamental importance in computer science and many application domains. For Grover's algorithm, solving the SAT problem requires $\mathcal{O}(\sqrt{2^n})$ queries--where n denotes the number of logic variables in the problem. However, Grover's algorithm suffers from the Souffle problem: specifically, when the number of solutions is unknown, terminating the algorithm too early or too late leads to a signif

Full text archived locally

✦ AI Summary · Claude Sonnet

Quantum Physics [Submitted on 11 Apr 2026] A parallel and distributed fixed-point quantum search algorithm for solving SAT problems He Wang, Jinyang Yao Boolean satisfiability (SAT) problem is of fundamental importance in computer science and many application domains. For Grover's algorithm, solving the SAT problem requires \mathcal{O}(\sqrt{2^n}) queries--where n denotes the number of logic variables in the problem. However, Grover's algorithm suffers from the Souffle problem: specifically, when the number of solutions is unknown, terminating the algorithm too early or too late leads to a significant reduction in the probability of obtaining a solution. In this paper, we propose a parallel fixed-point (PFP) search algorithm to solve the SAT problem. By exploiting entanglement, each clause in the conjunctive normal form (CNF) formula can be processed independently, leading to a significant reduction in circuit depth. We also discuss how to perform the algorithm in distributed manner. These make the PFPS algorithm particularly suitable for the noisy intermediate-scale quantum (NISQ) era. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.09980 [quant-ph] (or arXiv:2604.09980v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.09980 Focus to learn more Submission history From: He Wang [view email] [v1] Sat, 11 Apr 2026 01:28:20 UTC (47 KB) Access Paper: view license Current browse context: quant-ph < prev | next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

💬 Team Notes