A quantum algorithm for finding length of shortest path in the connected weighted graph

Authors:
Mir Shahriar Emami;Mohammad Reza Fattahi Tabasi;Hossein Keshmiri
Affiliations:
Islamic Azad University (Roudehen Branch), Roudehen, Iran;University of Tehran, Tehran, Iran;University of Kashan, Kashan, Iran
Venue:
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Year:
2008

Citing 5
Cited 0

C++: an introduction to data structures

C++: an introduction to data structures
Advanced Engineering Mathematics: Maple Computer Guide

Advanced Engineering Mathematics: Maple Computer Guide
Beyond Bits: The Future of Quantum Information Processing

Computer
A Short Introduction to Quantum Information and Quantum Computation

A Short Introduction to Quantum Information and Quantum Computation
Introduction to Quantum Information Science (Oxford Graduate Texts)

Introduction to Quantum Information Science (Oxford Graduate Texts)

Quantified Score

Hi-index	0.00

Visualization

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 O(n) whereas this problem based on the classic algorithm can be solved with time complexity about O(n2 -n).