A review on quantum search algorithms

Quantum Information Processing

Volumn 16, Issue 12, 2017, Pages

  Giri, Pulak Ranjan ^a   Korepin, Vladimir E ^b  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

Grover search algorithm; Partial database search; Quantum algorithms

Indexed keywords

DATABASE SYSTEMS; INFORMATION RETRIEVAL; LEARNING ALGORITHMS; QUANTUM COMPUTERS; QUANTUM THEORY; SEARCH ENGINES; SUBROUTINES;

DATABASE SEARCH ALGORITHMS; DATABASE SEARCHES; GROVER SEARCH ALGORITHM; MULTIPLE TARGETS; QUANTUM ALGORITHMS; QUANTUM PARALLELISM; QUANTUM SEARCH ALGORITHM; SUPERPOSITION OF STATE;

OPTIMIZATION;

EID: 85034591903     PISSN: 15700755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11128-017-1768-7     Document Type: Review

References (29)

1. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
2. Korepin, V.E., Xu, Y.: Quantum search algorithms. Int. J. Mod. Phys. B 31, 5727–5758 (2009)
3. Pathak, A.: Elements of Quantum Computation and Quantum Communication. CRC Press, Taylor and Francis Group, New York (2013)
4. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation. Quantum Comput. Quantum Inf. 305, 53–74 (2000)
5. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov 20–22 (1994)
6. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Stat. Comput. 26, 1484 (1997)
7. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium Theory of Computing (STOC), vol. 212 (1996)
8. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997)
9. Cleve, R., Ekert, A., Henderson, L., Macchiavello, C., Mosca, M.: On quantum algorithms. Complexity 4, 33 (1998)
10. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510 (1997)
11. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Frotsch. Phys. 46, 493 (1998)
12. Zalka, C.: Grover’s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746 (1999)
13. Grover, L.K., Radhakrishnan, J.: ACM Symposium on Parallel Algorithms and Architectures, vol. 186, Las Vegas, Nevada, USA (2005)
14. Choi, B.S., Korepin, V.E.: Quantum partial search of a database with several target items. Quantum Inf. Process. 6, 37 (2007)
15. Korepin, V.E.: Optimization of partial search. J. Phys. A 38, L731 (2005)
16. Korepin, V.E., Liao, J.: Quest for fast partial search algorithm. Quantum Inf. Process. 5, 1573 (2006)
17. Korepin, V.E., Vallilo, B.C.: Group theoretical formulation of a quantum partial search algorithm. Prog. Theor. Phys. 116, 783 (2006)
18. Korepin, V.E., Xu, Y.: Proceedings of the SPIE (Quantum Information and Computation V), vol. 6573, p. 65730C (2007)
19. Korepin, V.E., Xu, Y.: Hierarchical quantum search. Int. J. Mod. Phys. B 21, 5187 (2007)
20. Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80, 4329–4332 (1998)
21. Farhi, E., Gutmann, S.: Quantum Mechanical Square Root Speedup in a Structured Search Problem. arXiv: quant-ph/9711035
22. Grover, L.K.: Quantum search on structured problems. Chaos Solitons Fractals 10, 16951705 (1999)
23. Preskill, J.: Lecture Notes on Quantum Information and Computation. http://www.theory.caltech.edu/people/preskill/ph229/index.html
24. Long, G.L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64, 022307 (2001)
25. Toyama, F.M., van Dijk, W., Nogami, Y.: Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters. Quantum Inf. Process. 12, 1897–1914 (2013)
26. Farhi, E., Gutmann, S.: arXiv: quant-ph/9612026
27. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum Computation by Adiabatic Evolution. arXiv: quant-ph/0001106
28. Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002)
29. Choi, B.-S., Walker, T.A., Braunstein, S.L.: Sure success partial search. Quantum Inf. Process. 6, 1–8 (2007)