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.
After revision:  An algorithm has been reduced to O(\sqrt{2^{k*log_2n circuit for any given undirected and unweighted graph which makes the approach generalized in nature for Maximum Clique Problem.