{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T01:38:30Z","timestamp":1772329110584,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_46","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"540-551","source":"Crossref","is-referenced-by-count":17,"title":["Finding Is as Easy as Detecting for Quantum Walks"],"prefix":"10.1007","author":[{"given":"Hari","family":"Krovi","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"additional","affiliation":[]},{"given":"Maris","family":"Ozols","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Roland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","first-page":"22","volume-title":"Proc. 45th FOCS","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A.: Quantum walk algorithm for Element Distinctness. In: Proc. 45th FOCS, pp. 22\u201331. IEEE Computer Society Press, New York (2004)"},{"key":"46_CR2","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum Algorithms for the Triangle Problem. In: Proc. 16th SODA (2005)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Buhrman, H., \u0160palek, R.: Quantum verification of matrix products. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1007\/11523468_106","volume-title":"Automata, Languages and Programming","author":"F. Magniez","year":"2005","unstructured":"Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1312\u20131324. Springer, Heidelberg (2005)"},{"key":"46_CR5","doi-asserted-by":"publisher","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 of Computing\u00a01, 47\u201379 (2005)","journal-title":"Theory of Computing"},{"key":"46_CR6","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.: Quantum random-walk search algorithm. Phys. Rev. A 67, Article no. 052307 (2003)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"46_CR7","doi-asserted-by":"crossref","first-page":"042312","DOI":"10.1103\/PhysRevA.70.042312","volume":"70","author":"A.M. Childs","year":"2004","unstructured":"Childs, A.M., Goldstone, J.: Spatial search and the Dirac equation. Phys. Rev. A\u00a070(4), 042312 (2004)","journal-title":"Phys. Rev. A"},{"key":"46_CR8","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proc. 16th SODA, pp. 1099\u20131108 (2005)"},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00440-004-0423-2","volume":"133","author":"J. Kempe","year":"2005","unstructured":"Kempe, J.: Discrete quantum walks hit exponentially faster. Prob. Th. Rel. Fields\u00a0133(2), 215\u2013235 (2005)","journal-title":"Prob. Th. Rel. Fields"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proc. 45th FOCS, pp. 32\u201341 (2004)","DOI":"10.1109\/FOCS.2004.53"},{"issue":"3","key":"46_CR11","doi-asserted-by":"publisher","first-page":"32341","DOI":"10.1103\/PhysRevA.73.032341","volume":"73","author":"H. Krovi","year":"2006","unstructured":"Krovi, H., Brun, T.A.: Hitting time for quantum walks on the hypercube. Phys. Rev. A\u00a073(3), 032341 (2006)","journal-title":"Phys. Rev. A"},{"key":"46_CR12","first-page":"575","volume-title":"Proc. 39th STOC","author":"F. Magniez","year":"2007","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proc. 39th STOC, pp. 575\u2013584. ACM Press, New York (2007)"},{"key":"46_CR13","first-page":"86","volume-title":"Proc. 19th SODA, SIAM","author":"F. Magniez","year":"2009","unstructured":"Magniez, F., Nayak, A., Richter, P.C., Santha, M.: On the hitting times of quantum versus random walks. In: Proc. 19th SODA, SIAM, pp. 86\u201395. SIAM, Philadelphia (2009)"},{"issue":"1","key":"46_CR14","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(1), 012310 (2008)","journal-title":"Phys. Rev. A"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Krovi, H., Ozols, M., Roland, J.: On the adiabatic condition and the quantum hitting time of Markov chains. Technical Report arXiv:1004.2721, arXiv.org (2010)","DOI":"10.1103\/PhysRevA.82.022333"},{"key":"46_CR16","unstructured":"Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. Technical Report quant-ph\/9511026, arXiv.org (1995)"},{"issue":"1969","key":"46_CR17","doi-asserted-by":"publisher","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. Royal Society A\u00a0454(1969), 339\u2013354 (1998)","journal-title":"Proc. Royal Society A"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45061-0_25","volume-title":"Automata, Languages and Programming","author":"P. H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 291\u2013299. Springer, Heidelberg (2003)"},{"issue":"5","key":"46_CR19","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U. Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Feleg, D., Upfal, E.: Computing with noisy information. SIAM Journal on Computing\u00a023(5), 1001\u20131018 (1994)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:21Z","timestamp":1606168101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}