Login / Signup

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

Kunal Marwaha
Published in: Quantum (2021)
Keyphrases
  • max cut
  • graph model
  • planar graphs
  • graph partitioning
  • np complete problems
  • spectral graph
  • np hard
  • pairwise
  • data clustering
  • bipartite graph