Synthesis of Vertex Coloring Problem Using Grover's Algorithm

• Published in: 2015 IEEE International Symposium on Nanoelectronic and Information Systems pp. 101 - 106
• Main Authors: Saha, Amit, Chongder, Avik, Mandal, Sudhindu Bikash, Chakrabarti, Amlan
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2015
• Subjects: Grover's Search; Information systems; PMD; Vertex coloring
• DOI: 10.1109/iNIS.2015.55

Many applications such as Graph coloring, Triangle finding, Boolean satisfiability, Traveling salesman problem can be solved by Grover's search algorithm, which is one of the remarkable quantum computing algorithm. To design a quantum circuit for a given quantum algorithm, which involves Grover's search, we need to define an oracle circuit specific to the given algorithm and the diffusion operator for amplification of the desired quantum state. In this paper, we propose a quantum circuit implementation for the oracle of the vertex coloring problem based on Grover's algorithmic approach. To the best of our knowledge, this is a first of its kind approach in regards to the quantum circuit synthesis of the vertex coloring oracle in binary quantum domain. We have performed the synthesis of the proposed oracle circuit for the six commonly available Physical Machine Description (PMD) gate libraries using the Fault Tolerant Quantum Logic Synthesis (FTQLS) tool. The synthesis results have been presented to understand the cost estimation of the oracle circuit for the various PMDs in terms of number of quantum operations and number of cycles.