Run-time analysis of quantum algorithm for solution to a graph problem

摘要

Quantum computers have the ability to solve a variety of computational complex problems due the exponential quantum parallelism. This exponential quantum parallelism has made a big difference with respect to the quantum speed-up of many algorithms. Several proposals exist for modeling and devising procedures on computational problems related to integer factorization, discrete logarithms, searching, graph problems etc., which require exorbitant resources for their solution which otherwise is impossible on a classical computer. In this paper, we have considered a problem on graphs and discussed how the quantum add-on to the existing classical algorithm leads to efficient new quantum algorithms.