Issue No. 03 - May/June (2005 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2005.53
George F. Viamontes , University of Michigan
Igor L. Markov , University of Michigan
John P. Hayes , University of Michigan
Gauging a quantum algorithm's practical significance requires weighing it against the best conventional techniques applied to useful instances of a similar problem. The authors show that several commonly suggested applications fail to satisfy the requirements of Grover's quantum search algorithm—the most widely studied in this area.
algorithms, Web search, quantum
George F. Viamontes, Igor L. Markov, John P. Hayes, "Is Quantum Search Practical?", Computing in Science & Engineering, vol. 7, no. , pp. 62-70, May/June 2005, doi:10.1109/MCSE.2005.53