2020/12/08 by Kwok, Julia, Pudenz, Kristen
#FOS: Physical sciences #Quantum Physics (quant-ph)
paper · doi:10.48550/arxiv.2012.04470
We develop a heuristic graph coloring approximation algorithm that uses the D-Wave 2X as an independent set sampler and evaluate its performance against a fully classical implementation. A randomly generated set of small but hard graph instances serves as our test set. Our performance analysis suggests limited quantum advantage in the hybrid quantum-classical algorithm. The quantum edge holds over multiple metrics and suggests that graph problem applications are a good fit for quantum annealers.