40 citations · 47 across the 2 of their papers we have counts for
3 papers
quant-ph2025
Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families
Reuben Tate, Swati Gupta
There is a strong interest in finding challenging instances of NP-hard problems, from the perspective of showing quantum advantage. Due to the limits of near-term NISQ devices, it…
quant-ph2021★ 40 cited
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
Reuben Tate, Jai Moondra, Bryan Gard +2
We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the s…
quant-ph2020★ 7 cited
Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
Reuben Tate, Majid Farhadi, Creston Herold +2
We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem. Near-term (noisy) quantum devices are only able to (accurately) execute QAOA a…