{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:43Z","timestamp":1740137263091,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"QuantERA ERA-NET Cofund in Quantum Technologies"},{"DOI":"10.13039\/501100002261","name":"RFBR","doi-asserted-by":"crossref","award":["19-37-80008"],"award-info":[{"award-number":["19-37-80008"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11128-020-02939-4","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T07:03:09Z","timestamp":1609916589000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Upperbounds on the probability of finding marked connected components using quantum walks"],"prefix":"10.1007","volume":"20","author":[{"given":"Adam","family":"Glos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1834-8040","authenticated-orcid":false,"given":"Nikolajs","family":"Nahimovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Balakirev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil","family":"Khadiev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"2939_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6336-8","volume-title":"Quantum Walks and Search Algorithms","author":"R Portugal","year":"2013","unstructured":"Portugal, R.: Quantum Walks and Search Algorithms. Springer, New York (2013)"},{"issue":"2","key":"2939_CR2","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1103\/PhysRevA.48.1687","volume":"48","author":"Y Aharonov","year":"1993","unstructured":"Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687\u20131690 (1993)","journal-title":"Phys. Rev. A"},{"key":"2939_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915\u2013928 (1998)","journal-title":"Phys. Rev. A"},{"key":"2939_CR4","doi-asserted-by":"crossref","unstructured":"Reitzner, D., Nagaj, D., Buzek, V.: Quantum walks. Acta Phys. Slovaca 61, 6, pp. 603\u2013725, 2011). arXiv.1207.7283","DOI":"10.2478\/v10155-011-0006-6"},{"key":"2939_CR5","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.: A quantum random walk search algorithm. Phys. Rev. A 67, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"2939_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rivosh, A.: Quantum walks with multiple or moving marked locations. In: Proceedings of SOFSEM, pp. 485\u2013496 (2008)","DOI":"10.1007\/978-3-540-77566-9_42"},{"key":"2939_CR7","doi-asserted-by":"publisher","first-page":"022338","DOI":"10.1103\/PhysRevA.92.022338","volume":"92","author":"TG Wong","year":"2015","unstructured":"Wong, T.G., Ambainis, A.: Quantum search with multiple walk steps per oracle query. Phys. Rev. A 92, 022338 (2015)","journal-title":"Phys. Rev. A"},{"key":"2939_CR8","unstructured":"Nahimovs, N., Rivosh, A.: Quantum walks on two-dimensional grids with multiple marked locations. In: Proceedings of SOFSEM 2016, vol. 9587, pp. 381\u2013391 (2016). arXiv:1507.03788"},{"key":"2939_CR9","doi-asserted-by":"crossref","unstructured":"Nahimovs, N., Rivosh, A.: Exceptional configurations of quantum walks with Grover\u2019s coin. In: Proceedings of MEMICS, pp. 79\u201392 (2015)","DOI":"10.1007\/978-3-319-29817-7_8"},{"key":"2939_CR10","doi-asserted-by":"crossref","unstructured":"Nahimovs, N., Santos, R.: Adjacent vertices can be hard to find by quantum walks. In: Proceedings of SOFSEM 2017, vol. 10139, pp. 256\u2013267 (2017)","DOI":"10.1007\/978-3-319-51963-0_20"},{"key":"2939_CR11","doi-asserted-by":"publisher","first-page":"032334","DOI":"10.1103\/PhysRevA.94.032334","volume":"94","author":"K Pr\u016bsis","year":"2016","unstructured":"Pr\u016bsis, K., Vihrovs, J., Wong, T.G.: Stationary states in quantum walk search. Phys. Rev. A 94, 032334 (2016)","journal-title":"Phys. Rev. A"},{"key":"2939_CR12","unstructured":"Ambainis, A., Gily\u00e9n, A., Jeffery, S., Kokainis, M.: Quadratic speedup for finding marked vertices by quantum walks (2019) arXiv preprint arXiv:1903.07493"},{"issue":"11","key":"2939_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11128-019-2459-3","volume":"18","author":"A Glos","year":"2019","unstructured":"Glos, A., Miszczak, J.A.: Impact of the malicious input data modification on the efficiency of quantum spatial search. Quantum Inf. Process. 18(11), 343 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"2939_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3103\/S0278641919010060","volume":"43","author":"N Nahimovs","year":"2019","unstructured":"Nahimovs, N., Santos, R.A., Khadiev, K.: Adjacent vertices can be hard to find by quantum walks. Mosc. Univ. Comput. Math. Cybern. 43(1), 32\u201339 (2019)","journal-title":"Mosc. Univ. Comput. Math. Cybern."},{"key":"2939_CR15","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1134\/S1995080218070144","volume":"39","author":"K Khadiev","year":"2018","unstructured":"Khadiev, K., Nahimovs, N., Santos, R.A.M.: On the probability of finding marked connected components using quantum walks. Lobachevskii J. Math. 39, 1016\u20131023 (2018)","journal-title":"Lobachevskii J. Math."},{"issue":"37","key":"2939_CR16","doi-asserted-by":"publisher","first-page":"375302","DOI":"10.1088\/1751-8113\/49\/37\/375302","volume":"49","author":"P Sadowski","year":"2016","unstructured":"Sadowski, P., Miszczak, J.A., Ostaszewski, M.: Lively quantum walks on cycles. J. Phys. A Math. Theor. 49(37), 375302 (2016)","journal-title":"J. Phys. A Math. Theor."},{"key":"2939_CR17","unstructured":"Glos, A., Nahimovs, N.: Comment on Nahimovs et al. \u2018On the probability of finding marked connected components using quantum walks (2019). arXiv preprint arXiv:1907.12277"},{"issue":"1","key":"2939_CR18","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"6684","key":"2939_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"issue":"1","key":"2939_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"1","key":"2939_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2005.10129097","volume":"2","author":"A Flaxman","year":"2005","unstructured":"Flaxman, A., Frieze, A., Fenner, T.: High degree vertices and eigenvalues in the preferential attachment graph. Internet Math. 2(1), 1\u201319 (2005)","journal-title":"Internet Math."},{"issue":"3","key":"2939_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"BE Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.E., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02939-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-020-02939-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02939-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T08:33:17Z","timestamp":1612945997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-020-02939-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2939"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02939-4","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"8 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}