We applied a new variant of QAOA (Quantum Approximate Optimization Algorithm) based on the Grover algorithm (G-QAOA) to satisfiability problems (3-SAT and Max-SAT), relevant to optimization applications. We find that G-QAOA surpasses conventional QAOA in its ability to sample all solutions and shows quadratic speedup. Check it out on Quantum Science and Technology!
- Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering,
Zewen Zhang, Roger Paredes, Bhuvanesh Sundar, David Quiroga, Anastasios Kyrillidis, Leonardo Duenas-Osorio, Guido Pagano and Kaden R A Hazzard, Quantum Sci. Technol.,10 015022 (2024)