{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T11:28:43Z","timestamp":1750418923252,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_31","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"381-391","source":"Crossref","is-referenced-by-count":8,"title":["Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations"],"prefix":"10.1007","author":[{"given":"Nikolajs","family":"Nahimovs","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rivosh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"31_CR1","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":"2012","unstructured":"Ambainis, A., Ba\u010dkurs, A., Nahimovs, N., Ozols, R., Rivosh, A.: Search by quantum walks on two-dimensional grid without amplitude amplification. In: Kawano, Y. (ed.) TQC 2012. LNCS, vol. 7582, pp. 87\u201397. Springer, Heidelberg (2012)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"key":"31_CR3","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099\u20131108 (2005)"},{"key":"31_CR4","unstructured":"Ambainis, A., Portugal, R., Nahimov, N.: Spatial search on grids with minimum memory (2014). arXiv:1312.0172"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Spalek, R.: Quantum verification of matrix products. In: Proceedings SODA 2006, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-14165-2_46","volume-title":"Automata, Languages and Programming","author":"H Krovi","year":"2010","unstructured":"Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding is as easy as detecting for quantum walks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 540\u2013551. Springer, Heidelberg (2010)"},{"key":"31_CR7","unstructured":"Krov, H.: Symmetry in quantum walks (Ph.D thesis) (2007). arXiv:0711.1694"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"210502","DOI":"10.1103\/PhysRevLett.112.210502","volume":"112","author":"J Janmark","year":"2014","unstructured":"Janmark, J., Meyer, D.A., Wong, T.G.: Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett. 112, 210502 (2014). arXiv:1403.2228","journal-title":"Phys. Rev. Lett."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"110503","DOI":"10.1103\/PhysRevLett.114.110503","volume":"114","author":"DA Meyer","year":"2015","unstructured":"Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. Phys. Rev. Lett. 114, 110503 (2015). arXiv:1409.5876","journal-title":"Phys. Rev. Lett."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Magniez, F., Santha, M., Szegedy, M.: An $$O(n^{1.3})$$ quantum algorithm for the triangle problem. In: Proceedings of SODA 2005, pp. 413\u2013424 (2005)","DOI":"10.1137\/050643684"},{"key":"31_CR11","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":"5","key":"31_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(5), 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Szegedy, M: Quantum speed-up of markov chain based algorithms. In: Proceedings of FOCS 2004, pp. 32\u201341 (2004)","DOI":"10.1109\/FOCS.2004.53"},{"key":"31_CR14","unstructured":"Wong, T.G.: On the Breakdown of Quantum Search with Spatially Distributed Marked Vertices vol. 1501, p. 07071 (2015)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:17Z","timestamp":1748744357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}