“…Grover's algorithm has been used to obtain quantum speedups for various problems in combinatorial optimization and computer science (see, for e.g., [16], [17], [19], [22], [35]). Needless to say, graph coloring problems are also not an exception in the literature, and have been attacked using quantum annealing [21], [37], hybrid approaches [6], [36], as well as using Grover search [32], [34], [40].…”