Lov K. Grover
- BBBV94.C.H. Bennett, E. Bemstein, G. Brassard and U.Vazirani, Strengths and weaknesses of quantum computing, preprint, 1994.Google Scholar
- BB92.A. Berthiaume and G. Brassard, The quantum challenge to structural complexity theory, Proceedings 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132-137.Google ScholarCross Ref
- Benioff80.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.Google ScholarCross Ref
- BV93.E. Bernstein and U. Vazirani, Quantum Complexity Theory, Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 11-20. Google ScholarDigital Library
- Deutsch85.D. Deutsch, Quantum Theory, the Church-Turing principle and the universal quantum computer, Proceedings Royal Society London Ser. A, 400, pp. 96-117.Google Scholar
- DJ92.D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings Royal Society of London, A400, pp. 73-90.Google Scholar
- MVV87.K. Mulmuley, U. Vazirani and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, 7 (1987), pp. 105-131. Google ScholarDigital Library
- Penrose89.R. Penrose, The Emperor's New Mind, Concerning Computers, Minds and the Laws of Physics. Oxford University Press, 1989, pp. 400-402. Google ScholarDigital Library
- Penrose94.R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.Google Scholar
- Shor94.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.Google ScholarDigital Library
- Shor95.P.W. Shot, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, Vol. 52, October 1995, pp. 2493-2496.Google ScholarCross Ref
- Simon94.D. Simon, On the power of quantum computation, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 116- 123.Google ScholarDigital Library
- VV86.L.G. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 1986, pp. 85-93. Google ScholarDigital Library
- Yao93.A. Yao, Quantum circuit complexity, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.Google Scholar
Index Terms
- A fast quantum mechanical algorithm for database search
Recommendations
A review on quantum search algorithms
The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, ...
An efficient quantum search engine on unsorted database
We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called ...
A Proposal of a Quantum Search Algorithm
ICCIT '09: Proceedings of the 2009 Fourth International Conference on Computer Sciences and Convergence Information TechnologyFor searching an unsorted database with N items, a classical computer requires O(N) steps but Grover's quantum searching algorithm requires only O(√N) steps. However, it is also known that Grover's algorithm is effective in the case where the initial ...
Comments