Year: 2026
Type: preprint
Abstract: By intertwining ideas from sequential and adiabatic quantum computing, we propose a quantum algorithm for the problem class Exact Cover 3, which is a sub-class of 3-satisfiability (3-SAT) problems and NP (nondeterministic polynomial time) complete. We find a quantum run-time which is significantly faster than the square-root run-time $N\to N^{1/2}$ of the Grover algorithm. Depending on the structure of the problem (e.g., connectivity of clauses), the run-time scaling may range from approximately third root $N\to N^{1/3}$ to nearly fourth root $N\to N^{1/4}$, possibly even faster.
Source: arXiv (Cornell University)
Authors: Schaller, Gernot, Schützhold, Ralf
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236706830
