{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:44:42Z","timestamp":1774993482138,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,5,10]],"date-time":"2011-05-10T00:00:00Z","timestamp":1304985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9521-6","type":"journal-article","created":{"date-parts":[[2011,5,9]],"date-time":"2011-05-09T15:38:37Z","timestamp":1304955517000},"page":"91-116","source":"Crossref","is-referenced-by-count":50,"title":["On the Hitting Times of Quantum Versus Random Walks"],"prefix":"10.1007","volume":"63","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter C.","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,10]]},"reference":[{"issue":"4","key":"9521_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4086\/toc.2005.v001a004","volume":"1","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. 1(4), 47\u201379 (2005)","journal-title":"Theory Comput."},{"key":"9521_CR2","first-page":"50","volume-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing","author":"D. Aharonov","year":"2001","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 (2001)"},{"key":"9521_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/380752.380757","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing","author":"A. Ambainis","year":"2001","unstructured":"Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 37\u201349 (2001)"},{"key":"9521_CR4","first-page":"1099","volume-title":"Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms","author":"A. Ambainis","year":"2005","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1099\u20131108 (2005)"},{"key":"9521_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1, 507\u2013518 (2003)","journal-title":"Int. J. Quantum Inf."},{"issue":"1","key":"9521_CR6","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), 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"key":"9521_CR7","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1145\/1109557.1109654","volume-title":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms","author":"H. Buhrman","year":"2006","unstructured":"Buhrman, H., \u0160palek, R.: Quantum verification of matrix products. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 880\u2013889 (2006)"},{"key":"9521_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R. Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. Ser. A, Math. Phys. Sci. 454, 339\u2013354 (1998)","journal-title":"Proc. R. Soc. Lond. Ser. A, Math. Phys. Sci."},{"key":"9521_CR9","volume":"70","author":"A. Childs","year":"2004","unstructured":"Childs, A., Goldstone, J.: Spatial search and the Dirac equation. Phys. Rev. A 70, 042312 (2004)","journal-title":"Phys. Rev. A"},{"key":"9521_CR10","first-page":"212","volume-title":"Proceedings of the 28th ACM Symposium on the Theory of Computing","author":"L. Grover","year":"1996","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on the Theory of Computing, pp. 212\u2013219 (1996)"},{"key":"9521_CR11","unstructured":"Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. ECCC technical report 96-003 and arXiv:quant-ph\/9511026 (1995)"},{"key":"9521_CR12","series-title":"LNCS","volume-title":"Proceedings of 37st International Colloquium on 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: Proceedings of 37st International Colloquium on Automata, Languages and Programming, LNCS (2010)"},{"key":"9521_CR13","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/047","volume-title":"Classical and Quantum Computation","author":"A.Yu. Kitaev","year":"2002","unstructured":"Kitaev, A.Yu., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol.\u00a047. Am. Math. Soc., Providence (2002)"},{"issue":"3","key":"9521_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00453-007-0057-8","volume":"48","author":"F. Magniez","year":"2007","unstructured":"Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221\u2013232 (2007)","journal-title":"Algorithmica"},{"key":"9521_CR15","first-page":"575","volume-title":"Proceedings of the 39th ACM Symposium on Theory of Computing","author":"F. Magniez","year":"2007","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 575\u2013584 (2007)"},{"issue":"2","key":"9521_CR16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/S0097539702404377","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), 611\u2013629 (2007)","journal-title":"SIAM J. Comput."},{"key":"9521_CR17","unstructured":"Nayak, A., Vishwanath, A.: Quantum walk on the line. Technical report. arXiv:quant-ph\/0010117 (2000)"},{"key":"9521_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-79228-4_3","volume-title":"Proceedings of the 5th Conference on Theory and Applications of Models of Computation","author":"M. Santha","year":"2008","unstructured":"Santha, M.: Quantum walk based search algorithms. In: Proceedings of the 5th Conference on Theory and Applications of Models of Computation, LNCS, vol.\u00a04978, pp.\u00a031\u201346 (2008)"},{"key":"9521_CR19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N. Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.: A quantum random walk search algorithm. Phys. Rev. A 67, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"9521_CR20","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/FOCS.2004.53","volume-title":"Proceedings of the 45th Symposium on Foundations of Computer Science","author":"M. Szegedy","year":"2004","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)"},{"key":"9521_CR21","volume":"78","author":"A. Tulsi","year":"2008","unstructured":"Tulsi, A.: Faster quantum walk algorithm for the two dimensional spatial search. Phys. Rev. A 78, 012310 (2008)","journal-title":"Phys. Rev. A"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9521-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9521-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9521-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T23:43:52Z","timestamp":1637624632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9521-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,10]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9521"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9521-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,10]]}}}