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 (...
Sábháilte in:
| Príomhchruthaitheoirí: | , , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-03-01
|
| Sraith: | Quantum |
| Rochtain ar líne: | https://quantum-journal.org/papers/q-2022-03-30-678/pdf/ |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|