Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering

Zewen Zhang, Roger Paredes, Bhuvanesh Sundar +5

The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it ha…