CS 269 Q Project Final Report

We present an application of Grover’s algorithm to the 3-SAT problem, and verify the resulting square-root speedup over the classical search. We achieve this with reductions from CNFs to phase-flip oracles with depth linear in the number of gates and boolean variables. These reductions were implemented in pyQuil. To optimize the oracle circuits, we evaluated different circuit constructions: one based on Fredkin gates and four based on CCNOT. In our comparison of these different circuit construction and compilation methods, we found that CCNOT-based solutions require less qubits and gates. This is because they admit several tricks to reduce the total number of qubits and gates required.