A Quantum Algorithm for Finding Length of Shortest Path in the Connected Weighted Graph

M.S. Emami, M.R.F. Tabasi, and H. Keshmiri (Iran)

Keywords

Quantum Computing, Quantum Algorithm

Abstract

In this paper we are going to discuss on the Quantum Computation approach and then we present a Quantum Algorithm for finding the estimation of the shortest path length between two vertices in a connected weighted graph with a polynomial time complexity whereas this problem based on the classic algorithm can be solved with time complexity about 0(n² - n).

Important Links:

• DOI:
• From Proceeding (597) Parallel and Distributed Computing and Networks - 2008

Go Back