Advertisement

Faster search by lackadaisical quantum walk

Article

Abstract

In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of \(O(1/\log N)\) in \(O(\sqrt{N \log N})\) steps, which with amplitude amplification yields an overall runtime of \(O(\sqrt{N} \log N)\). We show that making the quantum walk lackadaisical or lazy by adding a self-loop of weight 4 / N to each vertex speeds up the search, causing the success probability to reach a constant near 1 in \(O(\sqrt{N \log N})\) steps, thus yielding an \(O(\sqrt{\log N})\) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem. Our results are based on numerical simulations since the algorithm is not an instance of the abstract search algorithm.

Keywords

Quantum walk Lackadaisical quantum walk Spatial search 

Notes

Acknowledgements

Thanks to Scott Aaronson for useful discussions. This work was supported by the U.S. Department of Defense Vannevar Bush Faculty Fellowship of Scott Aaronson.

References

  1. 1.
    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings 28th Annual ACM Symposium Theory Computing, STOC ’96, pp. 212–219. ACM, New York, NY (1996)Google Scholar
  2. 2.
    Benioff, P.: Space Searches with a Quantum Robot, volume 305 of Contemporary Mathematics, pp. 1–12. American Mathematical Society, Providence, RI (2002)MATHGoogle Scholar
  3. 3.
    Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theor. Comput. 1(4), 47–79 (2005)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70, 022314 (2004)ADSCrossRefGoogle Scholar
  5. 5.
    Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. Phys. Rev. Lett. 114, 110503 (2015)ADSCrossRefGoogle Scholar
  6. 6.
    Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings 16th Annual ACM-SIAM Symposium Discrete Algorithms, SODA ’05, pp. 1099–1108. SIAM, Philadelphia, PA (2005)Google Scholar
  7. 7.
    Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation, volume 305 of Contemporary Mathematics, pp. 53–74. American Mathematical Society, Providence, RI (2002)MATHGoogle Scholar
  8. 8.
    Childs, A.M., Goldstone, J.: Spatial search and the Dirac equation. Phys. Rev. A 70, 042312 (2004)ADSMathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. A Math. Theor. 48(43), 435304 (2015)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Wong, T.G.: Coined quantum walks on weighted graphs. J. Phys. A Math. Theor. 50(47), 475301 (2017)ADSMathSciNetCrossRefGoogle Scholar
  11. 11.
    Tulsi, A.: Faster quantum-walk algorithm for the two-dimensional spatial search. Phys. Rev. A 78, 012310 (2008)ADSCrossRefMATHGoogle Scholar
  12. 12.
    Ambainis, A., Bačkurs, A., Nahimovs, N., Ozols, R., Rivosh, A.: Search by quantum walks on two-dimensional grid without amplitude amplification. In: Proceedings 7th Annual Conference Theory of Quantum Computation, Communication, and Cryptography, TQC 2012, pp. 87–97. Springer, Tokyo (2013)Google Scholar
  13. 13.
    Krovi, H., Magniez, F., Ozols, M., Roland, J.: Quantum walks can find a marked element on any graph. Algorithmica 74(2), 851–907 (2016)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Portugal, R., Fernandes, T.D.: Quantum search on the two-dimensional lattice using the staggered model with hamiltonians. Phys. Rev. A 95, 042341 (2017)ADSCrossRefGoogle Scholar
  15. 15.
    Meyer, D.A.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85(5–6), 551–574 (1996)ADSMathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Meyer, D.A.: On the absence of homogeneous scalar unitary cellular automata. Phys. Lett. A 223(5), 337–340 (1996)ADSMathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67, 052307 (2003)ADSCrossRefGoogle Scholar
  18. 18.
    Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’04, pp. 32–41. IEEE Computer Society, Washington, DC (2004)Google Scholar
  19. 19.
    Magniez, F., Nayak, A., Richter, P.C., Santha, M.: On the hitting times of quantum versus random walks. Algorithmica 63(1), 91–116 (2012)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Wong, T.G.: Equivalence of Szegedy’s and coined quantum walks. Quantum Inf. Process. 16(9), 215 (2017)ADSMathSciNetCrossRefGoogle Scholar
  21. 21.
    Abal, G., Donangelo, R., Marquezino, F.L., Portugal, R.: Spatial search on a honeycomb network. Math. Struct. Comput. Sci. 20(6), 999–1009 (2010)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Marquezino, FdL, Portugal, R., Boettcher, S.: Spatial search algorithms on hanoi networks. Phys. Rev. A 87, 012329 (2013)ADSCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Texas at AustinAustinUSA
  2. 2.Department of PhysicsCreighton UniversityOmahaUSA

Personalised recommendations