Spatial quantum search in a triangular network

Mathematical Structures in Computer Science

Volumn 22, Issue 3, 2012, Pages 521-531

  Abal, G ^a   Donangelo, R ^a   Forets, M ^a   Portugal, R ^b  

^a INSTITUTO DE FÍSICA   (Uruguay)

^b LABORATÓRIO NACIONAL DE COMPUTAÇÃO CIENTÍFICA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM ALGORITHMS; QUANTUM SEARCH; SPATIAL SEARCH; TIME COMPLEXITY; TRIANGULAR LATTICE; TRIANGULAR NETWORK;

QUANTUM THEORY;

ALGORITHMS;

EID: 84860746687     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129511000600     Document Type: Article

References (11)

1. Abal, G., Donangelo, R., Marquezino, F. and Portugal, R. (2010) Spatial search in a honeycomb network. Mathematical Structures in Computer Science 20 (6) 999-1009.
2. Ambainis, A. and Aaronson, S. (2003) Quantum search of spatial regions. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 200-209.
3. Ambainis, A., Kempe, J. and Rivosh, A. (2005) Coins make quantum walks faster. SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms 78 (2) 1099-1108.
4. Benioff, P. (2002) Space searches with a quantum robot. In: Lomonaco, S. J. and Brandt, H.E. (eds.) Quantum Computation and Information, Contemporary Mathematics Series, AMS.
5. Grover, L. (1996) A fast quantum mechanical algorithm for database search. Proceedings 28th Annual ACM Symposium on the Theory of Computation, ACM Press 212-219.
6. Grover, L. (1997) Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 78 (2) 325-328.
7. Kittel, C. (1995) Introduction to Solid State Physics, 7th edition, Wiley.
8. Krovi, H., Magniez, F., Ozols M. and Roland, J. (2010) Finding is as easy as detecting for quantum walks. In: Abramsky, S., Gavoille, C., Kirchner, C., auf der Heide, F.M. and Spirakis, P. G. (eds.) Proceedings of the 37th international colloquium conference on Automata, languages and programming (ICALP'10). Springer-Verlag Lecture Notes in Computer Science 6198 540-551.
9. Magniez, F., Nayak, A., Richter, P. and Santha M. (2009) On the hitting times of quantum versus random walks. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09) 86-95.
10. Shenvi, N., Kempe, J. and Birgitta Whaley, F. (2003) A quantum random walk search algorithm. Physical Review A 67 052307.
11. Tulsi, A. (2008) Faster quantum walk algorithm for the two dimensional spatial search. Physical Review A 78 (1) 012310-1-012310-6.