Searching a Quantum Phone Book
- 31 January 1997
- journal article
- perspective
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 275 (5300) , 627-628
- https://doi.org/10.1126/science.275.5300.627
Abstract
Finding a phone number in a directory when one knows the name is easy; much harder is finding the name given the number. On average, a search algorithm will have to scan half the total number of entries. If the database or directory is extremely large, the search may be impossible with classical computers. New possibilities emerge, however, with quantum computing. As Brassard discusses in his Perspective, a new algorithm developed by L. K. Grover enables much faster searching of large databases if one uses a quantum computer.Keywords
This publication has 5 references indexed in Scilit:
- Algorithms for quantum computation: discrete logarithms and factoringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- All Together for Quantum ComputingScience, 1996
- Quantum Computing: Dream or Nightmare?Physics Today, 1996
- Quantum Computers, Factoring, and DecoherenceScience, 1995
- Quantum ComputationScience, 1995