Title :
An information-theoretic analysis of Grover´s algorithm
Author_Institution :
Dept. of Electr. Eng., Bilkent Univ., Ankara, Turkey
fDate :
29 June-4 July 2003
Abstract :
This paper presents an information-theoretic analysis of Grover´s algorithm and give a tight lower bound on the complexity of search algorithms using Grover´s oracle. This paper also proposes the square-root speed-up performance gain of a quantum search algorithm and the significance of tight bounds based on Grover´s oracle algorithm to identify target element.
Keywords :
computational complexity; information theory; quantum communication; quantum computing; Grover´s oracle algorithm; information-theoretic analysis; quantum search algorithm; search algorithm complexity; square-root speed-up performance gain; target identification; tight lower bound; Algorithm design and analysis; Computer errors; Entropy; Error correction; Information analysis; Performance gain; Physics computing; Quantum computing; Time measurement; Upper bound;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228418
