Hybrid quantum-classical algorithms for approximate graph coloring
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 (...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-03-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2022-03-30-678/pdf/ |