REVIEW 1 cited by
Graph Coloring with Quantum Annealing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation
A quantum graph-coloring framework with log-color encoding and a QFT-based mixer is presented; its chromatic-number term is flawed because label-sum minimization does not imply color-count minimization.
Discussion (0). Continue with ORCID to comment.