Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring

摘要

The Graph Coloring Grover Algorithm has several applications in logic synthesis, scheduling, allocation, planning, robot motion, robot communication, resource allocation, conflict resolution, floor-planning, and many others.It can serve as a “generic CSP solver” similar to a general SAT solver.