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 (n...

Full description

Bibliographic Details

Published in:	Quantum (Vienna, Austria) Vol. 6; p. 678
Main Authors:	Bravyi, Sergey, Kliesch, Alexander, Koenig, Robert, Tang, Eugene
Format:	Journal Article
Language:	English
Published:	Austria Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften 30.03.2022 Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
ISSN:	2521-327X, 2521-327X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!