{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:40:08Z","timestamp":1745944808564,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356551"},{"type":"electronic","value":"9783642356568"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35656-8_7","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:14:11Z","timestamp":1357298051000},"page":"87-97","source":"Crossref","is-referenced-by-count":19,"title":["Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Art\u016brs","family":"Ba\u010dkurs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolajs","family":"Nahimovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raitis","family":"Ozols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rivosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. In: Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp. 200\u2013209 (2003)"},{"key":"7_CR2","unstructured":"Ambainis, A., Backurs, A., Nahimovs, N., Ozols, R., Rivosh, A.: Search by quantum walks on two-dimensional grid without amplitude amplification. arXiv:quant-ph\/1112.3337, 22 pages (2011)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information\u00a01, 507\u2013518 (2003)","journal-title":"International Journal of Quantum Information"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","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(1)\u00a02007, 210\u2013239 (2007, 2001)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099\u20131108 (2005)"},{"key":"7_CR6","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.\u00a04910, pp. 485\u2013496. Springer, Heidelberg (2008)"},{"key":"7_CR7","series-title":"Contemp. Math.","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/305\/05212","volume-title":"Quantum Computation and Information","author":"P. Benioff","year":"2002","unstructured":"Benioff, P.: Space searches with a quantum robot. In: Quantum Computation and Information, Washington, DC. Contemp. Math., vol.\u00a0305, pp. 1\u201312. Amer. Math. Soc., Providence (2002)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Spalek, R.: Quantum Verification of Matrix Products. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026, 1411\u20131473 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR10","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 the 35th ACM STOC, pp. 59\u201368 (2003)","DOI":"10.1145\/780551.780552"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"42312","DOI":"10.1103\/PhysRevA.70.042312","volume":"70","author":"A. Childs","year":"2004","unstructured":"Childs, A., Goldstone, J.: Spatial search and the Dirac equation. Physical Review A\u00a070, 042312 (2004)","journal-title":"Physical Review A"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM STOC, Philadelphia, Pennsylvania, pp. 212\u2013219. ACM Press (1996)","DOI":"10.1145\/237814.237866"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J. Kempe","year":"2003","unstructured":"Kempe, J.: Quantum random walks - an introductory overview. Contemporary Physics\u00a044(4), 302\u2013327 (2003)","journal-title":"Contemporary Physics"},{"key":"7_CR14","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.\u00a06198, pp. 540\u2013551. Springer, Heidelberg (2010)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02199356","volume":"85","author":"D.A. Meyer","year":"1996","unstructured":"Meyer, D.A.: From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics\u00a085, 551\u2013574 (1996)","journal-title":"Journal of Statistical Physics"},{"key":"7_CR16","unstructured":"Marquezino, F.L., Portugal, R., Abal, G.: Mixing times in quantum walks on two-dimensional grids. arxiv:1006.4625"},{"key":"#cr-split#-7_CR17.1","unstructured":"Magniez, F., Santha, M., Szegedy, M.: An O(n 1.3) quantum algorithm for the triangle problem. In: Proceedings of SODA 2005, pp. 1109-1117 (2005)"},{"key":"#cr-split#-7_CR17.2","doi-asserted-by":"crossref","unstructured":"SIAM J. Comput. 37(2), 413-424 (2007)","DOI":"10.1137\/050643684"},{"issue":"5","key":"7_CR18","doi-asserted-by":"publisher","first-page":"52307","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. Physical Review A\u00a067(5), 052307 (2003)","journal-title":"Physical Review A"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: Quantum speed-up of Markov Chain based algorithms. In: Proceedings of IEEE FOCS 2004, pp. 32\u201341 (2004)","DOI":"10.1109\/FOCS.2004.53"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"12310","DOI":"10.1103\/PhysRevA.78.012310","volume":"78","author":"A. Tulsi","year":"2008","unstructured":"Tulsi, A.: Faster quantum-walk algorithm for the two-dimensional spatial search. Phys. Rev. A\u00a078, 012310 (2008)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35656-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:35Z","timestamp":1745942435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35656-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356551","9783642356568"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35656-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}