To everyone that had been following my earlier blog posts (<a href="https://blueqat.com/Sayan%20M./3b90bf72-ad93-41c1-9930-b27d2d204709" rel="noopener noreferrer" target="_blank">part 1</a> and <a href="https://blueqat.com/Sayan%20M./d0a5485a-2d76-42a3-afa4-1fdd293e20f2" rel="noopener noreferrer" target="_blank">part 2</a>) on the 3-coloring problem, we have published our results for its most general version on arXiv. Feel free to give the preprint a read at: <a href="https://arxiv.org/pdf/2108.09061.pdf" rel="noopener noreferrer" target="_blank">https://arxiv.org/pdf/2108.09061.pdf</a>! The preprint extends the circuit we described in the previous posts to the most general problem of list coloring. In list coloring we are given a graph G=(V,E) along with a list L(v) for every vertex v of G. When L(v) = {1, 2, ... , k} for every vertex v, the list coloring problem reduces to the renowned k-coloring problem! It would be interesting to figure out if we can find better algorithms for specific instances of the list coloring problem, such as k-coloring. We&#39;re now exploring the usage of quantum computing in machine learning/data science and computer graphics, so stay tuned for updates!

Preprint on quantum algorithm for list coloring published on arXiv

Sayan Mukherjee