4 papers · 1 filter
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…
Future of Quantum Computing
Scott Aaronson, Andrew M. Childs, Edward Farhi +2
On Tuesday 26th November 2024, four discussants participated in a moderated virtual panel titled Future of Quantum Computing as one session of the 8th International Conference on Q…
Constructive interference at the edge of quantum ergodic dynamics
Dmitry A. Abanin, Rajeev Acharya, Laleh Aghababaie-Beni +262
Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, qua…
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…