Corpus ID: 227209455

Hybrid quantum-classical algorithms for approximate graph coloring

@article{Bravyi2020HybridQA,
  title={Hybrid quantum-classical algorithms for approximate graph coloring},
  author={S. Bravyi and A. Kliesch and Robert Koenig and Eugene Tang},
  journal={arXiv: Quantum Physics},
  year={2020}
}
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX-$k$-CUT, the problem of finding an approximate $k$-vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level $p$: the approximation ratio achieved by QAOA is hardly better than assigning… Expand

Figures from this paper

Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks
Exploiting Symmetry Reduces the Cost of Training QAOA

References

SHOWING 1-10 OF 27 REFERENCES
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
Warm-starting quantum optimization
Multistart Methods for Quantum Approximate optimization
A Spectral Technique for Coloring Random 3-Colorable Graphs
MAX k-CUT and Approximating the Chromatic Number of Random Graphs
Barren plateaus in quantum neural network training landscapes
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications
...
1
2
3
...