{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:10:07Z","timestamp":1778256607403,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Higher Education, Malaysia","doi-asserted-by":"publisher","award":["FRGS\/1\/2024\/ICT04\/HWUM\/02\/1"],"award-info":[{"award-number":["FRGS\/1\/2024\/ICT04\/HWUM\/02\/1"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003093","name":"Ministry of Higher Education, Malaysia","doi-asserted-by":"publisher","award":["FRGS\/1\/2024\/ICT04\/HWUM\/02\/1"],"award-info":[{"award-number":["FRGS\/1\/2024\/ICT04\/HWUM\/02\/1"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The evolution operator of the lackadaisical quantum walk on a weighted cycle graph with self-loop weight\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$w&gt;0$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>w<\/mml:mi>\n                            <mml:mo>&gt;<\/mml:mo>\n                            <mml:mn>0<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is examined. With Grover oracle, the effect of different values of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$w$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>w<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    on the success probability of the search under various hyperparameter combinations is analyzed. The success probability function of the first few steps is provided algebraically, which in turn highlights the role of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$w$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>w<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    in governing the evolutionary behavior of the quantum walk search. These studies subsequently allow the numerical results to be obtained for various hyperparameter combinations, showing that the highest success probability for the weighted cycle graph with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$N$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>N<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    vertices is achieved using a flip-flop shift operator, a weighted coin superposition initial state, and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$w=\\frac{1.26}{N}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>w<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mfrac>\n                              <mml:mrow>\n                                <mml:mn>1.26<\/mml:mn>\n                              <\/mml:mrow>\n                              <mml:mi>N<\/mml:mi>\n                            <\/mml:mfrac>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . A comparison is also made with other known oracle, demonstrating that the proposed configuration provides a better trade-off between success probability and runtime. An extension of the study to the SKW scheme is also included, and it demonstrates that the scheme provides more variability and potential for quantum walk search.\n                  <\/jats:p>","DOI":"10.1007\/s11128-025-04945-w","type":"journal-article","created":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T06:37:53Z","timestamp":1759473473000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discrete-time quantum walk search on the cycle graph with weighted self-loop"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0423-4915","authenticated-orcid":false,"given":"Yong Qing","family":"Tiong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0591-3111","authenticated-orcid":false,"given":"Kai Lin","family":"Ong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1474-8717","authenticated-orcid":false,"given":"Ian K. T.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,3]]},"reference":[{"key":"4945_CR1","doi-asserted-by":"publisher","first-page":"100189","DOI":"10.1016\/j.physo.2023.100189","volume":"17","author":"MN Jayakody","year":"2023","unstructured":"Jayakody, M.N., Meena, C., Pradhan, P.: Revisiting one-dimensional discrete-time quantum walks with general coin. Phys. Open 17, 100189 (2023)","journal-title":"Phys. Open"},{"key":"4945_CR2","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. arXiv preprint, arXiv:quant-ph\/0402107 (2004)"},{"key":"4945_CR3","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"4945_CR4","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s00453-015-9979-8","volume":"74","author":"H Krovi","year":"2016","unstructured":"Krovi, H., Magniez, F., Ozols, M., Roland, J.: Quantum walks can find a marked element on any graph. Algorithmica 74, 851\u2013907 (2016)","journal-title":"Algorithmica"},{"key":"4945_CR5","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp 50\u201359 (2001)","DOI":"10.1145\/380752.380758"},{"key":"4945_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2101-9","volume":"17","author":"W Dai","year":"2018","unstructured":"Dai, W., Yuan, J., Li, D.: Discrete-time quantum walk on the cayley graph of the dihedral group. Quant. Inf. Process. 17, 1\u201321 (2018)","journal-title":"Quant. Inf. Process."},{"key":"4945_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11047-011-9279-4","volume":"11","author":"NB Lovett","year":"2012","unstructured":"Lovett, N.B., Everitt, M., Trevers, M., Mosby, D., Stockton, D., Kendon, V.: Spatial search using the discrete time quantum walk. Natural Comput. 11, 23\u201335 (2012)","journal-title":"Natural Comput."},{"key":"4945_CR8","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"4945_CR9","doi-asserted-by":"crossref","unstructured":"Li, J.: Exponential speedup of quantum algorithms for the pathfinding problem. Quantum Information Processing, 67 (2025)","DOI":"10.1007\/s11128-025-04689-7"},{"key":"4945_CR10","doi-asserted-by":"crossref","unstructured":"Koch, D., Hillery, M.: Finding paths in tree graphs with a quantum walk. Physical Review A (012308) (2018)","DOI":"10.1103\/PhysRevA.97.012308"},{"key":"4945_CR11","doi-asserted-by":"crossref","unstructured":"Reitzner, D., Hillery, M., Koch, D.: Finding paths with quantum walks or quantum walking through a maze. Phys. Rev. A (032323) (2017)","DOI":"10.1103\/PhysRevA.96.032323"},{"key":"4945_CR12","doi-asserted-by":"crossref","unstructured":"Inui, N., Konno, N., Segawa, E.: One-dimensional three-state quantum walk. Phys. Rev. E tatist. Nonlin. Soft Matter Phys. (056112) (2005)","DOI":"10.1103\/PhysRevE.72.056112"},{"key":"4945_CR13","doi-asserted-by":"crossref","unstructured":"Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. Math. Theoret. (435304) (2015)","DOI":"10.1088\/1751-8113\/48\/43\/435304"},{"key":"4945_CR14","doi-asserted-by":"crossref","unstructured":"Wong, T.G.: Coined quantum walks on weighted graphs. J. Phys. Math. Theoret. (475301) (2017)","DOI":"10.1088\/1751-8121\/aa8c17"},{"key":"4945_CR15","doi-asserted-by":"crossref","unstructured":"Wong, T.G.: Faster search by lackadaisical quantum walk. Quant Inform. Process. 1\u20139 (2018)","DOI":"10.1007\/s11128-018-1840-y"},{"key":"4945_CR16","doi-asserted-by":"crossref","unstructured":"Rhodes, M.L., Wong, T.G.: Search on vertex-transitive graphs by lackadaisical quantum walk. Quant. Inform. Process. 1\u201316 (2020)","DOI":"10.1007\/s11128-020-02841-z"},{"key":"4945_CR17","doi-asserted-by":"crossref","unstructured":"Rhodes, M.L., Wong, T.G.: Search by lackadaisical quantum walks with nonhomogeneous weights. Phys. Rev. A (042303) (2019)","DOI":"10.1103\/PhysRevA.100.042303"},{"key":"4945_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yuan, J.B., Dai, W.J., Li, D.: Three-state quantum walk on the cayley graph of the dihedral group. Quant. Inf. Process. 1\u201318 (2021)","DOI":"10.1007\/s11128-021-03042-y"},{"key":"4945_CR19","doi-asserted-by":"crossref","unstructured":"Sarkar, R.S., Adhikari, B.: Discrete-time quantum walks on cayley graphs of dihedral groups using generalized grover coins. Quant. Inform. Process. (172) (2024)","DOI":"10.1007\/s11128-024-04385-y"},{"key":"4945_CR20","doi-asserted-by":"crossref","unstructured":"Dai, W., Yuan, J., Li, D.: Discrete-time quantum walk with memory on the cayley graph of the dihedral group. Int. J. Theoret. Phys. 10\u201328 (2020)","DOI":"10.1007\/s10773-019-04257-7"},{"key":"4945_CR21","doi-asserted-by":"crossref","unstructured":"Giri, P.R., Korepin, V.: Lackadaisical quantum walk for spatial search. Modern Phys. Lett. A (2050043) (2020)","DOI":"10.1142\/S0217732320500431"},{"key":"4945_CR22","doi-asserted-by":"crossref","unstructured":"Nahimovs, N.: Lackadaisical quantum walks with multiple marked vertices. SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nov\u00fd Smokovec, Slovakia, January 27-30, 2019, Proceedings 45. Springer International Publishing, 368\u2013378 (2019)","DOI":"10.1007\/978-3-030-10801-4_29"},{"key":"4945_CR23","unstructured":"Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., Sur-Kolay, S.: Search of clustered marked states with lackadaisical quantum walks. arXiv preprint, arXiv:1804.01446 (2018)"},{"key":"4945_CR24","doi-asserted-by":"crossref","unstructured":"Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., Sur-Kolay, S.: Faster search of clustered marked states with lackadaisical quantum walks. Quantum Information Processing, 275 (2022)","DOI":"10.1007\/s11128-022-03606-6"},{"key":"4945_CR25","unstructured":"Wang, K., Wu, N., Xu, P., Song, F.: The lackadaisical quantum walker is not lazy at all. arXiv preprint, arXiv:1612.03370 (2016)"},{"key":"4945_CR26","doi-asserted-by":"crossref","unstructured":"Wong, T.G., Santos, R.A.: Exceptional quantum walk search on the cycle. Quantum Information Processing, 1\u201317 (2017)","DOI":"10.1007\/s11128-018-1840-y"},{"key":"4945_CR27","doi-asserted-by":"crossref","unstructured":"Giri, P.R.: Quantum walk search by grover search on coin space. Europ. Phys. J. D, 175 (2023)","DOI":"10.1140\/epjd\/s10053-023-00758-7"},{"key":"4945_CR28","doi-asserted-by":"crossref","unstructured":"Han, Q., Bai, N., Kou, Y., Wang, H.: Three-state quantum walks on cycles. Int. J. Modern Phys. B (2250075) (2022)","DOI":"10.1142\/S0217979222500758"},{"key":"4945_CR29","doi-asserted-by":"crossref","unstructured":"Inui, N., Konishi, Y., Konno, N.: Localization of two-dimensional quantum walks. Phys. Rev. A Atomic, Mol. Opt. Phys. (052323) (2004)","DOI":"10.1103\/PhysRevA.69.052323"},{"key":"4945_CR30","doi-asserted-by":"crossref","unstructured":"Wang, K., Wu, N., Xu, P., Song, F.: One-dimensional lackadaisical quantum walks. J. Phys. A Math. Theoret. (505303) (2017)","DOI":"10.1088\/1751-8121\/aa9235"},{"key":"4945_CR31","doi-asserted-by":"crossref","unstructured":"Wong, T.G.: Equivalence of szegedy\u2019s and coined quantum walks. Quant. Inform. Process. 215 (2017)","DOI":"10.1007\/s11128-017-1667-y"},{"key":"4945_CR32","doi-asserted-by":"crossref","unstructured":"Wong, T.G., Ambainis, A.: Quantum search with multiple walk steps per oracle query. Phys. Rev. A (022338) (2015)","DOI":"10.1103\/PhysRevA.92.022338"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04945-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04945-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04945-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T09:47:08Z","timestamp":1761817628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04945-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,3]]},"references-count":32,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["4945"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04945-w","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,3]]},"assertion":[{"value":"21 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"324"}}