Finding is as easy as detecting for quantum walks

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 540-551

  Krovi, Hari ^a   Magniez, Frédéric ^b   Ozols, Maris ^c,d   Roland, Jérémie ^c  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c NEC LABORATORIES AMERICA   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HITTING TIME; OPEN PROBLEMS; QUANTUM WALK; RANDOM WALK; SPATIAL SEARCH;

INTERPOLATION; LINGUISTICS; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 77955313487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_46     Document Type: Conference Paper

References (19)

1. Ambainis, A.: Quantum walk algorithm for Element Distinctness. In: Proc. 45th FOCS, pp. 22-31. IEEE Computer Society Press, New York (2004)
2. Magniez, F., Santha, M., Szegedy, M.: Quantum Algorithms for the Triangle Problem. In: Proc. 16th SODA (2005)
3. Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 880-889 (2006)
4. Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. In: Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1312-1324. Springer, Heidelberg (2005)
5. Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory of Computing 1, 47-79 (2005)
6. Shenvi, N., Kempe, J., Whaley, K.: Quantum random-walk search algorithm. Phys. Rev. A 67, Article no. 052307 (2003)
7. Childs, A. M., Goldstone, J.: Spatial search and the Dirac equation. Phys. Rev. A 70 (4), 042312 (2004)
8. Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proc. 16th SODA, pp. 1099-1108 (2005)
9. Kempe, J.: Discrete quantum walks hit exponentially faster. Prob. Th. Rel. Fields 133 (2), 215-235 (2005)
10. Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proc. 45th FOCS, pp. 32-41 (2004)
11. Krovi, H., Brun, T. A.: Hitting time for quantum walks on the hypercube. Phys. Rev. A 73 (3), 032341 (2006)
12. Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proc. 39th STOC, pp. 575-584. ACM Press, New York (2007)
13. Magniez, F., Nayak, A., Richter, P. C., Santha, M.: On the hitting times of quantum versus random walks. In: Proc. 19th SODA, SIAM, pp. 86-95. SIAM, Philadelphia (2009)
14. Tulsi, A.: Faster quantum-walk algorithm for the two-dimensional spatial search. Phys. Rev. A 78 (1), 012310 (2008)
15. Krovi, H., Ozols, M., Roland, J.: On the adiabatic condition and the quantum hitting time of Markov chains. Technical Report arXiv:1004.2721, arXiv.org (2010)
16. Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. Technical Report quant-ph/9511026, arXiv.org (1995)
17. Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. Royal Society A 454 (1969), 339-354 (1998)
18. Høyer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J. C. M., Lenstra, J. K., Parrow, J., Woeginger, G. J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 291-299. Springer, Heidelberg (2003)
19. Feige, U., Raghavan, P., Feleg, D., Upfal, E.: Computing with noisy information. SIAM Journal on Computing 23 (5), 1001-1018 (1994)