Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tuning for Quantum Speedup in Directed Lackadaisical Quantum Walks

Published 11 Nov 2022 in quant-ph | (2211.06167v3)

Abstract: Quantum walks constitute an important tool for designing quantum algorithms and information processing tasks. In a lackadaisical walk, in addition to the possibility of moving out of a node, the walker can remain on the same node with some probability. This is achieved by introducing self-loops, parameterized by self-loop strength $l$, attached to the nodes such that large $l$ implies a higher likelihood for the walker to be trapped at the node. In this work, {\it directed}, lackadaisical quantum walks is studied. Depending on $l$, two regimes are shown to exist -- one in which classical walker dominates and the other dominated by the quantum walker. In the latter case, we also demonstrate the existence of two distinct scaling regimes with $l$ for quantum walker on a line and on a binary tree. Surprisingly, a significant quantum-induced speedup is realized for large $l$. By tuning the initial state, the extent of this speedup can be manipulated.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Y. Aharonov, L. Davidovich, and N. Zagury, Quantum random walks, Phys. Rev. A 48, 1687 (1993).
  2. R. P. Feynman, Quantum mechanical computers, Foundations of physics 16, 507 (1986).
  3. A. Ambainis, Quantum Walk Algorithm for Element Distinctness, SIAM J. Comput. 37, 210–239 (2007).
  4. F. Magniez, M. Santha, and M. Szegedy, Quantum Algorithms for the Triangle Problem, SIAM Journal on Computing 37, 413 (2007), https://doi.org/10.1137/050643684 .
  5. A. M. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70, 022314 (2004).
  6. A. Montanaro, Quantum algorithms: an overview, npj Quantum Information 2, 1 (2016).
  7. R. Asaka, K. Sakai, and R. Yahagi, Quantum random access memory via quantum walk, Quantum Science and Technology 6, 035004 (2021).
  8. A. R. C. Buarque and W. S. Dias, Self-trapped quantum walks, Phys. Rev. A 101, 023802 (2020).
  9. K. Mukai and N. Hatano, Discrete-time quantum walk on complex networks for community detection, Phys. Rev. Research 2, 023378 (2020).
  10. L. Böttcher and M. A. Porter, Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks, SIAM Journal on Applied Mathematics 81, 2704 (2021), https://doi.org/10.1137/20M1385998 .
  11. A. M. Childs, Universal Computation by Quantum Walk, Phys. Rev. Lett. 102, 180501 (2009).
  12. A. M. Childs, D. Gosset, and Z. Webb, Universal Computation by Multiparticle Quantum Walk, Science 339, 791 (2013), https://www.science.org/doi/pdf/10.1126/science.1229957 .
  13. S. Aaronson and Y. Shi, Quantum Lower Bounds for the Collision and the Element Distinctness Problems, J. ACM 51, 595–605 (2004).
  14. H. Buhrman and R. Špalek, Quantum Verification of Matrix Products, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA ’06 (Society for Industrial and Applied Mathematics, USA, 2006) p. 880–889.
  15. L. Neves and G. Puentes, Photonic Discrete-time Quantum Walks and Applications, Entropy 20, 10.3390/e20100731 (2018).
  16. K. Georgopoulos, C. Emary, and P. Zuliani, Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers, Phys. Rev. A 103, 022408 (2021).
  17. A. A. Melnikov, L. E. Fedichkin, and A. Alodjants, Predicting quantum advantage by quantum walk with convolutional neural networks, New Journal of Physics 21, 125002 (2019).
  18. T. G. Wong, Grover search with lackadaisical quantum walks, Journal of Physics A: Mathematical and Theoretical 48, 435304 (2015a).
  19. N. Inui, N. Konno, and E. Segawa, One-dimensional three-state quantum walk, Phys. Rev. E 72, 056112 (2005).
  20. T. G. Wong, Faster search by lackadaisical quantum walk, Quantum Information Processing 17, 1 (2018).
  21. L. S. de Souza, J. H. A. de Carvalho, and T. A. E. Ferreira, Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices, in Intelligent Systems, edited by A. Britto and K. Valdivia Delgado (Springer International Publishing, Cham, 2021) pp. 249–263.
  22. C.-F. Chiang, Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term, Quantum Information Processing 19, 1 (2020).
  23. U. Schöning, A Probabilistic Algorithm for K-SAT and Constraint Satisfaction Problems, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS ’99 (IEEE Computer Society, USA, 1999) p. 410.
  24. E. Campos, S. E. Venegas-Andraca, and M. Lanzagorta, Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances, Scientific Reports 11, 1 (2021).
  25. P. Boito and R. Grena, Quantum hub and authority centrality measures for directed networks based on continuous-time quantum walks, Journal of Complex Networks 9, 10.1093/comnet/cnab038 (2021), cnab038, https://academic.oup.com/comnet/article-pdf/9/6/cnab038/41137870/cnab038.pdf .
  26. S. Hoyer and D. A. Meyer, Faster transport with a directed quantum walk, Phys. Rev. A 79, 024307 (2009).
  27. T. G. Wong, Grover search with lackadaisical quantum walks, Journal of Physics A: Mathematical and Theoretical 48, 435304 (2015b).
  28. N. Nahimovs and R. A. M. Santos, Lackadaisical quantum walks on 2D grids with multiple marked vertices, Journal of Physics A: Mathematical and Theoretical 54, 415301 (2021).
  29. A. Montanaro, Quantum Walks on Directed Graphs, Quantum Info. Comput. 7, 93–102 (2007).
  30. H. Krovi and T. A. Brun, Hitting time for quantum walks on the hypercube, Phys. Rev. A 73, 032341 (2006).

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.