Generalization of grover’s algorithm to multiobject search in quantum computing, part I: Continuous time and discrete time

Mathematics of Quantum Computation

Volumn , Issue , 2002, Pages 135-160

  Chen, Goong ^a   Fulling, Stephen A ^a   Chen, Jeesen ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; QUANTUM COMPUTERS;

CONTINUOUS-TIME; DISCRETE TIME; DISCRETE-TIME CASE; HILBERT SPACE FRAMEWORK; QUADRATIC SPEEDUP; QUANTUM COMPUTING; SEARCH ALGORITHMS; SEARCH CRITERION;

QUANTUM OPTICS;

EID: 85053444096     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (15)

1. E. Biham, O. Biham, D. Biron, M. Grassl and D.A. Lidar, Grover’s quantum search algorithm for an arbitrary initial amplitude distribution, Phys. Rev. A 60 (1999), 2742–2745.
2. D. Biron, O. Biham, E. Biham, M. Grassl and D.A. Lidar, Generalized Grover search algorithm for arbitrary initial amplitude distribution, in Quantum Computing and Quantum Communications Lecture Notes. Comp. Sci., vol. 1509, Springer-Verlag, New York, 1998, pp. 140–147.
3. M. Boyer, G. Brassard, P. Høyer and A. Tapp, Tight bounds on quantum searching, Fortsch. Phys. 46 (1998), 493–506.
4. G. Brassard, P. Høyer and A. Tapp, Quantum counting, quant-ph/9805082, May 1998.
5. I.L. Chuang, N. Gershenfeld and M. Kubinec, Experimental implementation of fast quantum searching, Phys. Rev. Lett. 80 (1998), 3408–3441.
6. E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation, Phys. Rev. A 57 (1998), 2403–2405.
7. L.K. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th Annual Symposium on the Theory of Computing, 212–218, ACM Press, New York, 1996.
8. L.K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 78 (1997), 325–328.
9. L.K. Grover, Quantum computers can search rapidly by using almost any transformation, Phys. Rev. Lett. 80 (1998), 4329–4332.
10. R. Jozsa, Searching in Grover’s algorithm, quant-ph/9901021, Jan. 1999.
11. D. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, second edition, Addison-Wesley, Reading, MA, 1973.
12. A. Messiah, Quantum Mechanics, Vol. 2, Wiley, New York, 1966.
13. P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proc. 35th IEEE Symposium on the Foundations of Computer Sci., 124–134, 1994.
14. P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp. 26 (1997), 1484–1510.
15. C. Zalka, Grover’s quantum searching algorithm is optimal, Phys. Rev. A 60 (1999), 2746–2751. See also quant-ph/9711070, Nov. 1997.