Before revision:  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 .
After revision:  An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph which makes the approach generalized in nature . The experimental result of the generic algorithm has been implemented in the IBMQ\_Qasm\_Simulator. The generated circuit can also be mapped in Noisy Intermediate-Scale Quantum (NISQ) devices(IBM QX architecture) .