Exploiting the deep structure of constraint problems
Artificial Intelligence
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
New methods to color the vertices of a graph
Communications of the ACM
Information Sciences—Informatics and Computer Science: An International Journal - Special Issue on Quantum Computing and Neural Information Processing
Feynman Lectures on Computation
Feynman Lectures on Computation
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Quantum approaches to graph colouring
Theoretical Computer Science
| Hi-index | 0.00 |
We present a quantum computer heuristic search algorithm for graph coloring. This algorithm uses a new quantum operator, appropriate for nonbinary-valued constraint satisfaction problems, and information available in partial colorings. We evaluate the algorithm empirically with small graphs near a phase transition in search performance. It improves on two prior quantum algorithms: unstructured search and a heuristic applied to the satisfiability (SAT) encoding of graph coloring. An approximate asymptotic analysis suggests polynomial-time cost for hard graph coloring problems, on average.