Spatial search on a honeycomb network

Mathematical Structures in Computer Science

Volumn 20, Issue 6, 2010, Pages 999-1009

  Abal, G ^a   Donangelo, R ^a   Marquezino, F L ^b   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

HEXAGONAL LATTICE; HONEYCOMB LATTICES; HONEYCOMB NETWORKS; QUANTUM ALGORITHMS; QUANTUM SEARCH ALGORITHM; QUANTUM WALK; SEARCH ALGORITHMS; SPATIAL SEARCH; TIME COMPLEXITY;

LEARNING ALGORITHMS; QUANTUM THEORY;

HONEYCOMB STRUCTURES;

EID: 79251607409     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129510000332     Document Type: Article

References (16)

1. Aaronson, S. and Ambainis, A. (2003) Quantum Search of Spatial Regions. In: FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science 200-203.
2. Aharonov, Y., Davidovich, L. and Zagury, N. (1993) Quantum Random Walks. Physical Review A 48 1687-1690.
3. Ambainis, A. (2004) Quantum walk algorithm for element distinctness. In: Proceedings 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS) 22-31.
4. Ambainis, A., Kempe, J. and Rivosh, A. (2005) Coins make quantum walks faster. In: SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms 1099-1108.
5. Benioff, P. (2002) Space Searches with a Quantum Robot. In: Lomonaco, S. J. and Brandt, H.E. (eds.) Quantum Computation and Quantum Information: A millenium volume. AMS Contemporary Math. Series 305 1-12. Available at arXiv:quant-ph/0003006.
6. Bennett, C. H., Bernstein, E., Brassard, G. and Vazirani, U.V. (1997) Strengths and Weaknesses of Quantum Computing. SIAM Journal on Computing 26 1510-1523.
7. Brassard, G., Hoyer, P., Mosca, M. and Tapp, A. (2002) Quantum amplitude amplification and estimation. In: Lomonaco, S. J. and Brandt, H.E. (eds.) Quantum Computation and Quantum Information: A millenium volume. AMS Contemporary Math. Series 305 53-74 (2002).
8. Childs, A. M. and Goldstone, J. (2004) Spatial search by quantum walk. Physical Review A 70 022314.
9. Farhi, E. and Gutmann, S. (1998) Quantum computation and decision trees. Physical Review A 58 915-928.
10. Geim, A.K. and MacDonald, A. H. (2007) Graphene: exploring carbon flatland Phys. Today 35-41.
11. Grover, L. (1996) A fast quantum mechanical algorithm for database search. In: Proc. 28th Annual ACM Symposium on the Theory of Computation, (New York, NY), ACM Press 212-219.
12. Kittel, C. (1995) Introduction to Solid State Physics, 7th edition, Wiley.
13. Shenvi, N., Kempe, J. and Whaley, K.B. (2003) A quantum random walk search algorithm. Physical Review A 67 052307.
14. Tulsi, A. (2008) Faster quantum walk algorithm for the two dimensional spatial search. Physical Review A 78 (1) 012310.
15. Van den Nest, M., Miyake, A., Dür, W. and Briegel, H. J. (2006) Universal Resources for Measurement-Based Quantum Computation. Physical Review Letters 97 150504.
16. Wallace, P.R. (1947) The band theory of graphite. Physical Review 71 622-634.