Now-a-days in Quantum Computing, implementation of quantum algorithm has created a stir since Noisy Intermediate-Scale Quantum (NISQ) devices are out in the market. Researchers are mostly interested in solving NP-complete problems with the help of quantum algorithms for its speed-up. As per the work on computational complexity by Karp, if any of the NP-complete problem can be solved then any other NP-complete problem can be reduced to that problem in polynomial time. In this Paper, K-coloring problem (NP-complete problem) has been considered to solve using Grover's search. A comparator-based approach has been used to implement K-coloring problem which enables the reduction of the qubit cost comparing to the state-of-the-art. An end-to-end automated framework has been proposed to implement K-coloring problem for any unweighted and undirected graph on any available Noisy Intermediate-Scale Quantum (NISQ) devices, which helps in generalizing our approach.

中文翻译：

---

K-着色问题的电路设计及其在近程量子器件上的实现

现在在量子计算中，自从嘈杂的中级量子 (NISQ) 设备上市以来，量子算法的实施引起了轰动。研究人员最感兴趣的是在量子算法的帮助下解决 NP 完全问题以提高其速度。根据 Karp 在计算复杂度方面的工作，如果可以解决任何 NP 完全问题，则可以在多项式时间内将任何其他 NP 完全问题简化为该问题。在本文中，K-着色问题（NP-完全问题）已被考虑使用 Grover 搜索来解决。基于比较器的方法已被用于实现 K 着色问题，与现有技术相比，该方法能够降低量子位成本。