Search by quantum walks on two-dimensional grid without amplitude amplification

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

Volumn 7582 LNCS, Issue , 2013, Pages 87-97

  Ambainis, Andris ^a   Bačkurs, Arturs ^a   Nahimovs, Nikolajs ^a   Ozols, Raitis ^a   Rivosh, Alexander ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

NEIGHBOURHOOD; QUANTUM WALK; TWO-DIMENSIONAL GRIDS;

COMMUNICATION; PROBABILITY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; TWO DIMENSIONAL;

AMPLIFICATION;

EID: 84893366288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35656-8_7     Document Type: Conference Paper

References (19)

1. Aaronson, S., Ambainis, A.: Quantum search of spatial regions. In: Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp. 200-209 (2003)
2. Ambainis, A., Backurs, A., Nahimovs, N., Ozols, R., Rivosh, A.: Search by quantum walks on two-dimensional grid without amplitude amplification. arXiv:quant-ph/1112.3337, 22 pages (2011)
3. Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information 1, 507-518 (2003)
4. Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1) 2007, 210-239 (2007, 2001)
5. Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099-1108 (2005)
6. Ambainis, A., Rivosh, A.: QuantumWalks with Multiple or Moving Marked Locations. In: Geffert, V., Karhum̈aki, J., Bertoni, A., Preneel, B., Ńavrat, P., Bielikov́a, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 485-496. Springer, Heidelberg (2008)
7. Benioff, P.: Space searches with a quantum robot. In: Quantum Computation and Information, Washington, DC. Contemp. Math., vol. 305, pp. 1-12. Amer. Math. Soc., Providence (2002)
8. Buhrman, H., Spalek, R.: Quantum Verification ofMatrix Products. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, pp. 880-889 (2006)
9. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the 35th ACM STOC, pp. 59-68 (2003)
10. Childs, A., Goldstone, J.: Spatial search and the Dirac equation. Physical Review A 70, 042312 (2004)
11. Grover, L.:Afast quantummechanical algorithmfor database search. In:Proceedings of the 28th ACM STOC, Philadelphia, Pennsylvania, pp. 212-219. ACM Press (1996)
12. Kempe, J.: Quantum random walks - an introductory overview. Contemporary Physics 44(4), 302-327 (2003)
13. Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding Is as Easy as Detecting for Quantum Walks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 540-551. Springer, Heidelberg (2010)
14. Meyer, D.A.: From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics 85, 551-574 (1996)
15. Marquezino, F.L., Portugal, R., Abal, G.: Mixing times in quantum walks on two-dimensional grids. arxiv:1006.4625
16. Magniez, F., Santha, M., Szegedy, M.: An O(n1.3) quantum algorithm for the triangle problem. In: Proceedings of SODA 2005, pp. 1109-1117 (2005); SIAM J. Comput. 37(2), 413-424 (2007)
17. Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Physical Review A 67(5), 052307 (2003)
18. Szegedy, M.: Quantum speed-up of Markov Chain based algorithms. In: Proceedings of IEEE FOCS 2004, pp. 32-41 (2004)
19. Tulsi, A.: Faster quantum-walk algorithm for the two-dimensional spatial search. Phys. Rev. A 78, 012310 (2008)