Quantum random walks - New method for designing quantum algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4910 LNCS, Issue , 2008, Pages 1-4

  Ambainis, Andris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; MARKOV PROCESSES;

QUANTUM RANDOM WALKS; QUANTUM SPEEDUP;

QUANTUM COMPUTERS;

EID: 38549141735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77566-9_1     Document Type: Conference Paper

References (27)

1. Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. Journal of ACM 51(4), 595-605 (2004)
2. Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information 1, 507-518 (2003)
3. Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of FOCS 2004, pp. 22-31 (2004)
4. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory of Computing 1, 37-46 (2005)
5. 1/2+o(1) on a quantum computer. In: Proceedings of FOCS 2007, pp. 363-372 (2007)
6. Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099-1108 (2005)
7. Barnum, H., Saks, M.: A lower bound on the quantum complexity of read once functions. Journal of Computer and System Sciences 69, 244-258 (2004)
8. Boneh, D., Lipton, R.: Quantum cryptanalysis of hidden linear functions (extended abstract). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 424-437. Springer, Heidelberg (1995)
9. Buhrman, H., Spalek, R.: Quantum verification of matrix products. In: Proceedings of SODA 2006, pp. 880-889 (2006)
10. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information Science. AMS Contemporary Mathematics Series, vol. 305, pp. 53-74 (2002)
11. Brassard, G., Hoyer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, CL., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163-169. Springer, Heidelberg (1998)
12. Brassard, G., Høyer, P., Tapp, A.: Quantum counting. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 820-831. Springer, Heidelberg (1998)
13. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by quantum walk. In: Proceedings of STOC 2003, pp. 59-68 (2003)
14. Childs, A.M., Goldstone, J.: Spatial search and the Dirac equation. Physical Review A 70, 42312 (2004)
15. Farhi, E., Goldstone, J., Gutman, S., Sipser, M.: A quantum adiabatic algorithm applied to random instances of an NP-complete problem. Science 292, 472-476 (2001)
16. Farhi, E., Goldstone, J., Gutman, S.: A Quantum Algorithm for the Hamiltonian NAND Tree. arXiv preprint quant-ph/0702144
17. Freivalds, R.: Fast probabilistic algorithms. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 57-69. Springer, Heidelberg (1979)
18. Grover, L.: A fast quantum mechanical algorithm for database search. In: Grover, L. (ed.) Proceedings of STOC 1996, pp. 212-219 (1996)
19. Hallgren, S.: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. Journal of the ACM 54, 1 (2007)
20. Jozsa, R.: Quantum factoring, discrete logarithms, and the hidden subgroup problem. IEEE Multimedia 3, 34-43 (1996)
21. Kempe, J.: Quantum random walks - an introductory overview. Contemporary Physics 44(4), 307-327 (2003)
22. Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221-232 (2007)
23. Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of STOC 2007, pp. 575-584 (2007)
24. Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM Journal on Computing 37(2), 413-424 (2007)
25. Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. In: Proceedings of STOC 1999, pp. 384-393 (1999)
26. Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proceedings of FOCS 1994, pp. 124-134 (1994)
27. Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of FOCS 2004, pp. 32-41 (2004)