Faster than square-root run-time in adiabatic quantum algorithms for Exact Cover 3
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.
Authors
- Ralf Schützhold
- Gernot Schaller (ORCID: https://orcid.org/0000-0003-0062-9944)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.23956
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- preprint