Exceptional Configurations of Quantum Walks with Grover’s Coin

  • Nikolajs Nahimovs
  • Alexander RivoshEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9548)


We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation — Grover’s diffusion transformation — has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. This extends the class of known exceptional configurations; until now the only known such configuration was the “diagonal construction” by [AR08].


Quantum Walk Exceptional Configurations Marked Locations Diffusional Transformation Ambainis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supplementary material


  1. [Amb07]
    Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, 210–239 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [AKR05]
    Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099–1108 (2005)Google Scholar
  3. [AR08]
    Ambainis, A., Rivosh, A.: Quantum walks with multiple or moving marked locations. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 485–496. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. [BS06]
    Buhrman, H., Spalek, R.: Quantum verification of matrix products. In: Proceedings of SODA 2006, pp. 880–889 (2006)Google Scholar
  5. [CC+03]
    Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of 35th ACM STOC, pp. 59–68 (2003)Google Scholar
  6. [MSS05]
    Magniez, F., Santha, M., Szegedy, M.: An \(O(n^{1.3})\) quantum algorithm for the triangle problem. In: Proceedings of SODA 2005, pp. 413–424 (2005)Google Scholar
  7. [NR15]
    Nahimovs, N., Rivosh, A.: Quantum walks on two-dimensional grids with multiple marked locations. arXiv:1507.03788 (2015)
  8. [Por13]
    Portugal, R.: Quantum Walks and Search Algorithms. Springer, Heidelberg (2013)CrossRefzbMATHGoogle Scholar
  9. [SKW03]
    Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Phys. Rev. A 67(5), 052307 (2003)CrossRefGoogle Scholar
  10. [Sze04]
    Szegedy, M.: Quantum speed-up of Markov Chain based algorithms. In: Proceedings of FOCS 2004, pp. 32–41 (2004)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Faculty of ComputingUniversity of LatviaRigaLatvia

Personalised recommendations