{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:53:13Z","timestamp":1761598393109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030917012"},{"type":"electronic","value":"9783030917029"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91702-9_17","type":"book-chapter","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T20:02:46Z","timestamp":1638043366000},"page":"249-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6527-7065","authenticated-orcid":false,"given":"Luciano S.","family":"de Souza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2672-7801","authenticated-orcid":false,"given":"Jonathan H. A.","family":"de Carvalho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2131-9825","authenticated-orcid":false,"given":"Tiago A. E.","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,28]]},"reference":[{"issue":"2","key":"17_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 (1993)","journal-title":"Phys. Rev. A"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-35656-8_7","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"A Ambainis","year":"2013","unstructured":"Ambainis, A., Ba\u010dkurs, A., Nahimovs, N., Ozols, R., Rivosh, A.: Search by quantum walks on two-dimensional grid without amplitude amplification. In: Iwama, K., Kawano, Y., Murao, M. (eds.) TQC 2012. LNCS, vol. 7582, pp. 87\u201397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35656-8_7"},{"key":"17_CR3","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. arXiv preprint quant-ph\/0402107 (2004)"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.062202","volume":"103","author":"G Bezerra","year":"2021","unstructured":"Bezerra, G., Lug\u00e3o, P., Portugal, R.: Quantum walk-based search algorithms with multiple marked vertices. Phys. Rev. A 103(6), 062202 (2021)","journal-title":"Phys. Rev. A"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-61377-8_9","volume-title":"Intelligent Systems","author":"JHA de Carvalho","year":"2020","unstructured":"de Carvalho, J.H.A., de Souza, L.S., de Paula Neto, F.M., Ferreira, T.A.E.: Impacts of multiple solutions on the Lackadaisical Quantum Walk search algorithm. In: Cerri, R., Prati, R.C. (eds.) BRACIS 2020. LNCS (LNAI), vol. 12319, pp. 122\u2013135. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61377-8_9"},{"key":"17_CR6","unstructured":"Carvalho, J.H.A., Souza, L.S., Paula Neto, F.M., Ferreira, T.A.E.: On applying the lackadaisical quantum walk algorithm to search for multiple solutions on grids. arXiv preprint quant-ph\/2106.06274 (2021)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kempe, J.: Quantum random walks hit exponentially faster. arXiv preprint quant-ph\/0205083 (2002)","DOI":"10.1007\/978-3-540-45198-3_30"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"McMahon, D.: Quantum Computing Explained. Wiley, New York (2007)","DOI":"10.1002\/9780470181386"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-45726-7_14","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"C Moore","year":"2002","unstructured":"Moore, C., Russell, A.: Quantum walks on the hypercube. In: Rolim, J.D.P., Vadhan, S. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 164\u2013178. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45726-7_14"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-10801-4_29","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"N Nahimovs","year":"2019","unstructured":"Nahimovs, N.: Lackadaisical Quantum Walks with multiple marked vertices. In: Catania, B., Kr\u00e1lovi\u010d, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 368\u2013378. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10801-4_29"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3103\/S0278641919010060","volume":"43","author":"N Nahimovs","year":"2019","unstructured":"Nahimovs, N., Santos, R.A.M., Khadiev, K.R.: 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":"17_CR12","doi-asserted-by":"crossref","unstructured":"Nahimovs, N., Santos, R.A.: Lackadaisical quantum walks on 2D grids with multiple marked vertices. arXiv preprint arXiv:2104.09955 (2021)","DOI":"10.1088\/1751-8121\/ac21e3"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. AAPT, Cambridge (2002)","DOI":"10.1119\/1.1463744"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.79.012325","volume":"79","author":"V Poto\u010dek","year":"2009","unstructured":"Poto\u010dek, V., G\u00e1bris, A., Kiss, T., Jex, I.: Optimized quantum random-walk search algorithms on the hypercube. Phys. Rev. A 79(1), 012325 (2009)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.99.032301","volume":"99","author":"ML Rhodes","year":"2019","unstructured":"Rhodes, M.L., Wong, T.G.: Quantum walk search on the complete bipartite graph. Phys. Rev. A 99(3), 032301 (2019)","journal-title":"Phys. Rev. A"},{"issue":"9","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02841-z","volume":"19","author":"ML Rhodes","year":"2020","unstructured":"Rhodes, M.L., Wong, T.G.: Search on vertex-transitive graphs by lackadaisical quantum walk. Quantum Inf. Process. 19(9), 1\u201316 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"17_CR17","doi-asserted-by":"publisher","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(5), 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Singh, J., Singh, M.: Evolution in quantum computing. In: 2016 International Conference System Modeling & Advancement in Research Trends (SMART), pp. 267\u2013270. IEEE (2016)","DOI":"10.1109\/SYSMART.2016.7894533"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Souza, L.S., Carvalho, J.H.A., Ferreira, T.A.E.: Quantum walk to train a classical artificial neural network. In: 2019 8th Brazilian Conference on Intelligent Systems (BRACIS), pp. 836\u2013841. IEEE (2019)","DOI":"10.1109\/BRACIS.2019.00149"},{"key":"17_CR20","unstructured":"Souza, L.S., Carvalho, J.H.A., Ferreira, T.A.E.: Classical artificial neural network training using quantum walks as a search procedure. IEEE Trans. Comput. (2021)"},{"issue":"5","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11128-012-0432-5","volume":"11","author":"SE Venegas-Andraca","year":"2012","unstructured":"Venegas-Andraca, S.E.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015\u20131106 (2012)","journal-title":"Quantum Inf. Process."},{"key":"17_CR22","unstructured":"Wang, H., Zhou, J., Wu, J., Yi, X.: Adjustable self-loop on discrete-time quantum walk and its application in spatial search. arXiv preprint arXiv:1707.00601 (2017)"},{"issue":"43","key":"17_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/48\/43\/435304","volume":"48","author":"TG Wong","year":"2015","unstructured":"Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. A: Math. Theor. 48(43), 435304 (2015)","journal-title":"J. Phys. A: Math. Theor."},{"issue":"3","key":"17_CR24","doi-asserted-by":"publisher","first-page":"1","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(3), 1\u20139 (2018)","journal-title":"Quantum Inf. Process."},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Yanofsky, N.S., Mannucci, M.A.: Quantum Computing for Computer Scientists. Cambridge University Press, Cambridge (2008)","DOI":"10.1017\/CBO9780511813887"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91702-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T04:34:47Z","timestamp":1726202087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91702-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030917012","9783030917029"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91702-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/c4ai.inova.usp.br\/bracis\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"192","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":"77","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":"0","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":"40% - 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.1","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)"}},{"value":"Due to COVID-19, the conference was held as an online event.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}