7.2k citations · 23.3k across the 83 of their papers we have counts for
86 papers
Decoupling of the QAOA into independent spin-boson systems and high-depth performance on pure and mixed spin glasses
Sami Boulebnane, Abid Khan, Pragna Subrahmanya +4
The Quantum Approximate Optimization Algorithm (QAOA) is regarded as a promising candidate for near-term quantum advantage in combinatorial optimization, yet our ability to study i…
Provable Classical and Quantum Local Algorithms for Max--Cut and Quantum Advantage at Moderate Girth
Anuj Apte, Abid Khan, Edward Farhi +3
Broadening the study of quantum optimization algorithms from binary to -element alphabets has been shown to open new avenues for potential quantum advantage. A quantum advantage…
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…
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…
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…