Kunal Marwaha

most citedLocal classical MAX-CUT algorithm outperforms

p = 2

QAOA on high-girth regular graphs

43 citations · 43 across the 1 of their papers we have counts for

collaborators

1 paper

quant-ph2021★ 43 cited

Local classical MAX-CUT algorithm outperforms $p = 2$ QAOA on high-girth regular graphs

Kunal Marwaha

The $p$ -stage Quantum Approximate Optimization Algorithm (QAOA $_{p}$ ) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but i…

Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs

Local classical MAX-CUT algorithm outperforms $p = 2$ QAOA on high-girth regular graphs