Quantum Query Complexity to Determine Radius of a Graph

Vol.2 No.4

Year: 2008

Issue: April-June

Title: Quantum Query Complexity to Determine Radius of a Graph   

Author Name: Manjula Gandhi S, R. Prabhakar   

Synopsis:   

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.