{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:08:53Z","timestamp":1775736533233,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T00:00:00Z","timestamp":1445212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Faperj","doi-asserted-by":"crossref","award":["E-26\/102.350\/2013"],"award-info":[{"award-number":["E-26\/102.350\/2013"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004586","name":"Faperj","doi-asserted-by":"crossref","award":["E-45\/2013"],"award-info":[{"award-number":["E-45\/2013"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11128-015-1149-z","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T02:24:24Z","timestamp":1445221464000},"page":"85-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["The staggered quantum walk model"],"prefix":"10.1007","volume":"15","author":[{"given":"R.","family":"Portugal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. A. M.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. D.","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. N.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,19]]},"reference":[{"issue":"2","key":"1149_CR1","doi-asserted-by":"crossref","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"},{"issue":"5\u20136","key":"1149_CR2","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02199356","volume":"85","author":"DA Meyer","year":"1996","unstructured":"Meyer, D.A.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85(5\u20136), 551\u2013574 (1996)","journal-title":"J. Stat. Phys."},{"key":"1149_CR3","doi-asserted-by":"crossref","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":"1149_CR4","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of the 45th Symposium on Foundations of Computer Science, pp. 32\u201341 (2004)","DOI":"10.1109\/FOCS.2004.53"},{"key":"1149_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.54"},{"issue":"1","key":"1149_CR6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1137\/090745854","volume":"40","author":"F Magniez","year":"2011","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. SIAM J. Comput. 40(1), 142\u2013164 (2011)","journal-title":"SIAM J. Comput."},{"key":"1149_CR7","doi-asserted-by":"crossref","unstructured":"Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding is as easy as detecting for quantum walks. In: Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming, pp. 540\u2013551, (2010)","DOI":"10.1007\/978-3-642-14165-2_46"},{"issue":"2","key":"1149_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/050643684","volume":"37","author":"F Magniez","year":"2007","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413\u2013424 (2007)","journal-title":"SIAM J. Comput."},{"key":"1149_CR9","doi-asserted-by":"crossref","first-page":"7088","DOI":"10.1007\/978-0-387-30440-3_423","volume-title":"Encyclopedia of Complexity and Systems Science","author":"M Mosca","year":"2009","unstructured":"Mosca, M.: Quantum algorithms. In: Meyers, Robert A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 7088\u20137118. Springer, New York (2009)"},{"issue":"11","key":"1149_CR10","doi-asserted-by":"crossref","first-page":"4197","DOI":"10.1016\/j.jfa.2014.09.003","volume":"267","author":"Yusuke Higuchi","year":"2014","unstructured":"Higuchi, Yusuke, Konno, Norio, Sato, Iwao, Segawa, Etsuo: Spectral and asymptotic properties of grover walks on crystal lattices. J. Funct. Anal. 267(11), 4197\u20134235 (2014)","journal-title":"J. Funct. Anal."},{"key":"1149_CR11","doi-asserted-by":"crossref","unstructured":"Santha, M.: Quantum walk based search algorithms. In: Proceedings of the 5th Theory and Applications of Models of Computation (TAMC08), pp. 31\u201346 (2008)","DOI":"10.1007\/978-3-540-79228-4_3"},{"key":"1149_CR12","doi-asserted-by":"crossref","first-page":"032347","DOI":"10.1103\/PhysRevA.71.032347","volume":"71","author":"A Patel","year":"2005","unstructured":"Patel, A., Raghunathan, K.S., Rungta, P.: Quantum random walks do not need a coin toss. Phys. Rev. A 71, 032347 (2005)","journal-title":"Phys. Rev. A"},{"key":"1149_CR13","doi-asserted-by":"crossref","first-page":"032331","DOI":"10.1103\/PhysRevA.82.032331","volume":"82","author":"A Patel","year":"2010","unstructured":"Patel, A., Raghunathan, K.S., Rahaman, MdA: Search on a hypercubic lattice using a quantum random walk. ii. $$d=2$$ d = 2 . Phys. Rev. A 82, 032331 (2010)","journal-title":"Phys. Rev. A"},{"key":"1149_CR14","unstructured":"Falk, M.: Quantum search on the spatial grid. arXiv:1303.4127 , (2013)"},{"key":"1149_CR15","first-page":"1233","volume":"15","author":"A Ambainis","year":"2015","unstructured":"Ambainis, A., Portugal, R., Nahimov, N.: Spatial search on grids with minimum memory. Quantum Inf. Comput. 15, 1233\u20131247 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"1149_CR16","doi-asserted-by":"crossref","first-page":"052319","DOI":"10.1103\/PhysRevA.91.052319","volume":"91","author":"R Portugal","year":"2015","unstructured":"Portugal, R., Boettcher, S., Falkner, S.: One-dimensional coinless quantum walks. Phys. Rev. A 91, 052319 (2015)","journal-title":"Phys. Rev. A"},{"key":"1149_CR17","doi-asserted-by":"crossref","unstructured":"Santos, R.A.M., Portugal, R., Boettcher, S.: Moments of coinless quantum walks on lattices. Quantum Inf. Process. 14(9), 3179\u20133191 (2015)","DOI":"10.1007\/s11128-015-1042-9"},{"key":"1149_CR18","first-page":"1","volume":"1422","author":"M Hamada","year":"2005","unstructured":"Hamada, M., Konno, N., Segawa, E.: Relation between coined quantum walks and quantum cellular automata. RIMS Kokyuroku 1422, 1\u201311 (2005)","journal-title":"RIMS Kokyuroku"},{"key":"1149_CR19","doi-asserted-by":"crossref","first-page":"030301","DOI":"10.1103\/PhysRevA.74.030301","volume":"74","author":"FW Strauch","year":"2006","unstructured":"Strauch, F.W.: Connecting the discrete- and continuous-time quantum walks. Phys. Rev. A 74, 030301 (2006)","journal-title":"Phys. Rev. A"},{"key":"1149_CR20","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the 33rd ACM Symposium on Theory of computing, pp. 50\u201359 (2000)","DOI":"10.1145\/380752.380758"},{"key":"1149_CR21","doi-asserted-by":"crossref","first-page":"052307","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, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"1149_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"1149_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6336-8","volume-title":"Quantum Walks and Search Algorithms","author":"Renato Portugal","year":"2013","unstructured":"Portugal, Renato: Quantum Walks and Search Algorithms. Springer, New York (2013)"},{"issue":"1","key":"1149_CR24","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932)","journal-title":"Am. J. Math."},{"key":"1149_CR25","series-title":"Addison-Wesley Series in Mathematics","volume-title":"Graph Theory","author":"F Harary","year":"1994","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Series in Mathematics. Perseus Books, New York (1994)"},{"issue":"2","key":"1149_CR26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"LW Beineke","year":"1970","unstructured":"Beineke, L.W.: Characterizations of derived graphs. J. Comb. Theory 9(2), 129\u2013135 (1970)","journal-title":"J. Comb. Theory"},{"key":"1149_CR27","first-page":"75","volume":"50","author":"J Krausz","year":"1943","unstructured":"Krausz, J.: D\u00e9monstration nouvelle d\u2019une th\u00e9or\u00e8me de Whitney sur les r\u00e9seaux. Mat. Fiz. Lapok 50, 75\u201385 (1943)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-1149-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-015-1149-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-1149-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:17:22Z","timestamp":1589588242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-015-1149-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,19]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1149"],"URL":"https:\/\/doi.org\/10.1007\/s11128-015-1149-z","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,19]]}}}