DeepAI AI Chat
Log In Sign Up

Circuit Synthesis of Maximum Clique Problem using Combinatorial Approach of Classical-Quantum Hybrid Model

by   Arpita Sanyal, et al.

In the Maximum Clique Problem, the objective is to find a clique whose size is maximum among all the cliques of an arbitrary undirected and unweighted graph. Maximum Clique Problem resembles with minimum vertex cover problem, independent set problem. As it is an NP-hard problem, no polynomial time algorithms can be found. As these problems have several important practical applications such as information retrieval, community detection in network, spatial data mining etc, it is of great interest to try to synthesis the circuit of Maximum Clique Problem. In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)). In this paper, Maximum Clique Problem has been solved using combinatorial approach of Grover's search algorithm. An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph which makes the approach generalized in nature for Maximum Clique Problem. Computational speed up is achieved by using our approach with the help of quantum mechanical effect that is quantum superposition. We have simulated the proposed circuit using IBM's QISkit platform and verified its correctness.


How to hide a clique?

In the well known planted clique problem, a clique (or alternatively, an...

Randomized heuristic for the maximum clique problem

A clique in a graph is a set of vertices that are all directly connected...

Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search

We compare the performance of several variations of the Quantum Alternat...

A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem

The ecologist H. T. Odum introduced a principle of physics, called Maxim...

Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk

In this work, we consider the application of continuous time quantum wal...

Combinatorial Optimization by Decomposition on Hybrid CPU--non-CPU Solver Architectures

The advent of new special-purpose hardware such as FPGA or ASIC-based an...

Quantum Clique Gossiping

This paper establishes a framework for the acceleration of quantum gossi...