2 papers
quant-ph2026
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
Edward Farhi, Sam Gutmann, Daniel Ranard +1
We study MaxCut on 3-regular graphs of minimum girth for various 's. We obtain new lower bounds on the maximum cut achievable in such graphs by analyzing the Quantum Approxi…
quant-ph2024
Strategies for running the QAOA at hundreds of qubits
Brandon Augustino, Madelyn Cain, Edward Farhi +5
We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, followi…