A fast quantum mechanical algorithm for database search

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 212-219

  Grover, Lov K ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEARCH ENGINES; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTERS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; QUANTUM THEORY;

CONSTANT FACTORS; DATABASE SEARCHES; QUANTUM MECHANICAL; QUANTUM-MECHANICAL SYSTEM;

QUANTUM THEORY; ALGORITHMS;

DATABASE SEARCH; QUANTUM MECHANICAL ALGORITHM;

EID: 0029701737     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237866     Document Type: Conference Paper

References (14)

1. C. H. Bennett, E. Bernstein, G. Brassard and U. Vazirani, Strengths and weaknesses of quantum computing, preprint, 1994.
2. A. Berfhiaume and G. Brassard, The quantum challenge to structural complexity theory, Proceedings 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132-137.
3. P. Benioff, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, Journal of Statistical Physics, 22, pp. 563-591.
4. E. Bernstein and U. Vazirani, Quantum Complexity Theory, Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 11-20.
5. D. Deutsch, Quantum Theory, the Church-Turing principle and the universal quantum computer, Proceedings Royal Society London Ser. A, 400, pp. 96-117.
6. D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings Royal Society of London, A400, pp. 73-90.
7. K. Mulmuley, U. Vazirani and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, 7(1987), pp. 105-131.
8. R. Penrose, The Emperor's New Mind, Concerning Computers, Minds and the Laws of Physics. Oxford University Press, 1989, pp. 400-402.
9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348-388.
10. P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 124-134.
11. P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, Vol. 52, October 1995, pp. 2493-2496.
12. D. Simon, On the power of quantum computation, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 116-123.
13. L. G. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 1986, pp. 85-93.
14. A. Yao, Quantum circuit complexity, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.