JSE_V2_N4_RP5
Quantum Query Complexity to Determine Radius of a Graph
S. Manjula Gandhi
R. Prabhakar
Journal on Software Engineering
2230 – 7168
2
4
64
69
Quantum computing, Qubit, Quantum parallelism, Graph Theory, Eccentricity
Algorithms are the key concepts of computer science. Classical computer science provides a vast body of concepts and techniques which may be reused to great effect in quantum computing. Many of the triumphs of quantum computing have come by combining existing ideas from computer science with the ideas from quantum mechanics. The problem of determining quantum query complexity for obtaining the Radius of a graph is considered both in a classical system and in a quantum system. Algorithms are the key concepts of computer science. Classical computer science provides a vast body of concepts and techniques which may be reused to great effect in quantum computing. Many of the triumphs of quantum computing have come by combining existing ideas from computer science with the ideas from quantum mechanics. The problem of determining quantum query complexity for obtaining the Radius of a graph is considered both in a classical system and in a quantum system.
April - June 2008
Copyright © 2008 i-manager publications. All rights reserved.
i-manager Publications
http://www.imanagerpublications.com/Article.aspx?ArticleId=498