{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:28:17Z","timestamp":1765888097597,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_29","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"368-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Lackadaisical Quantum Walks with Multiple Marked Vertices"],"prefix":"10.1007","author":[{"given":"Nikolajs","family":"Nahimovs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"2","key":"29_CR1","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":"29_CR2","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1099\u20131108 (2005)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-540-77566-9_42","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"A Ambainis","year":"2008","unstructured":"Ambainis, A., Rivosh, A.: Quantum walks with multiple or moving marked locations. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 485\u2013496. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77566-9_42"},{"key":"29_CR4","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":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-29817-7_8","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"N Nahimovs","year":"2016","unstructured":"Nahimovs, N., Rivosh, A.: Exceptional configurations of quantum walks with Grover\u2019s coin. In: Kofro\u0148, J., Vojnar, T. (eds.) MEMICS 2015. LNCS, vol. 9548, pp. 79\u201392. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29817-7_8"},{"key":"29_CR6","doi-asserted-by":"crossref","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:quant-ph\/150703788","DOI":"10.1007\/978-3-662-49192-8_31"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-51963-0_20","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"N Nahimovs","year":"2017","unstructured":"Nahimovs, N., Santos, R.A.M.: Adjacent vertices can be hard to find by quantum walks. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 256\u2013267. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_20"},{"issue":"5","key":"29_CR8","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1103\/PhysRevE.72.056112","volume":"72","author":"N Inui","year":"2005","unstructured":"Inui, N., Konno, N., Segawa, E.: One-dimensional three-state quantum walk. Phys. Rev. E Stat. Nonlin. Soft Matter Phys. 72(5), 168\u2013191 (2005)","journal-title":"Phys. Rev. E Stat. Nonlin. Soft Matter Phys."},{"key":"29_CR9","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). https:\/\/doi.org\/10.1007\/978-1-4614-6336-8"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Reitzner, D., Nagaj, D., Buzek, V.: Quantum walks. Acta Physica Slovaca 61(6), 603\u2013725 (2011). arxiv.org\/abs\/1207.7283","DOI":"10.2478\/v10155-011-0006-6"},{"key":"29_CR11","unstructured":"Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., Sur-Kolay, S.: Search of clustered marked states with lackadaisical quantum walks (2018). arXiv:1804.01446"},{"key":"29_CR12","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"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1103\/PhysRevA.90.012342","volume":"90","author":"M Stefanak","year":"2014","unstructured":"Stefanak, M., Bezdekova, I., Jex, I.: Limit distributions of three-state quantum walks: the role of coin eigenstates. Phys. Rev. A 90(1), 124\u2013129 (2014)","journal-title":"Phys. Rev. A"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. A Math. Gen. 48 (2015)","DOI":"10.1088\/1751-8113\/48\/43\/435304"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1007\/s11128-015-1239-y","volume":"15","author":"TG Wong","year":"2016","unstructured":"Wong, T.G.: Spatial search by continuous-time quantum walk with multiple marked vertices. Quantum Inf. Process. 15(4), 1411\u20131443 (2016)","journal-title":"Quantum Inf. Process."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s11128-018-1840-y","volume":"17","author":"TG Wong","year":"2018","unstructured":"Wong, T.G.: Faster search by lackadaisical quantum walk. Quantum Inf. Process. 17, 68 (2018)","journal-title":"Quantum Inf. Process."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"0022338","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, 0022338 (2015)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:17:54Z","timestamp":1709810274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}