Graph coloring with quantum heuristics
Alex Fabrikant, Tad Hogg · 2002
We present a quantum computer heuristic search algorithm for graph coloring. This algorithm uses a new quantum operator, appropriate for nonbinary-valued constraint satis-faction problems, and information available in partial col-orings. We evaluate the algorithm empirically with small graphs near a phase transition in search performance. It im-proves on two prior quantum algorithms: unstructured search and a heuristic applied to the satisfiability (SAT) encoding of graph coloring. An approximate asymptotic analysis sug-gests polynomial-time cost for hard graph coloring problems, on average.