{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T09:10:10Z","timestamp":1748769010508,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298160"},{"type":"electronic","value":"9783319298177"}],"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-319-29817-7_8","type":"book-chapter","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T05:46:18Z","timestamp":1454478378000},"page":"79-92","source":"Crossref","is-referenced-by-count":7,"title":["Exceptional Configurations of Quantum Walks with Grover\u2019s Coin"],"prefix":"10.1007","author":[{"given":"Nikolajs","family":"Nahimovs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rivosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","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":"8_CR2","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099\u20131108 (2005)"},{"key":"8_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)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Spalek, R.: Quantum verification of matrix products. In: Proceedings of SODA 2006, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of 35th ACM STOC, pp. 59\u201368 (2003)","DOI":"10.1145\/780542.780552"},{"key":"8_CR6","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":"8_CR7","doi-asserted-by":"crossref","unstructured":"Nahimovs, N., Rivosh, A.: Quantum walks on two-dimensional grids with multiple marked locations. arXiv:1507.03788 (2015)","DOI":"10.1007\/978-3-662-49192-8_31"},{"key":"8_CR8","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, Heidelberg (2013)"},{"issue":"5","key":"8_CR9","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":"8_CR10","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"}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29817-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T08:49:44Z","timestamp":1748767784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29817-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298160","9783319298177"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29817-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}