{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T13:34:32Z","timestamp":1781530472350,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744559","type":"print"},{"value":"9783540744566","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_48","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"536-547","source":"Crossref","is-referenced-by-count":11,"title":["An Improved Claw Finding Algorithm Using Quantum Walk"],"prefix":"10.1007","author":[{"given":"Seiichiro","family":"Tani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"48_CR1","first-page":"595","volume":"51","author":"S. Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J.\u00a0ACM\u00a051(4), 595\u2013605 (2004)","journal-title":"J.\u00a0ACM"},{"key":"48_CR2","first-page":"22","volume-title":"Proc. 45th IEEE FOCS","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proc. 45th IEEE FOCS, pp. 22\u201331. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"48_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G. Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation, Quantum Computation and Quantum Information: A Millennium Volume. AMS Contem. Math.\u00a0305, 53\u201374 (2002)","journal-title":"AMS Contem. Math."},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"LATIN\u201998: Theoretical Informatics","author":"G. Brassard","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 163\u2013169. Springer, Heidelberg (1998)"},{"key":"48_CR5","volume-title":"A series of Modern Surveys in Mathematics","author":"A.E. Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. In: Brouwer, A.E., Cohen, A.M., Neumaier, A. (eds.) A series of Modern Surveys in Mathematics, Springer, Heidelberg (1989)"},{"key":"48_CR6","first-page":"131","volume-title":"Proc. 16th IEEE Conference on Computational Complexity","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for element distinctness. In: Proc. 16th IEEE Conference on Computational Complexity, pp. 131\u2013137. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"6","key":"48_CR7","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0097539702402780","volume":"34","author":"H. Buhrman","year":"2005","unstructured":"Buhrman, H., D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for element distinctness. SIAM J. Comput.\u00a034(6), 1324\u20131330 (2005)","journal-title":"SIAM J. Comput."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., \u0160palek, R.: Quantum verification of matrix products. In: Proc. 17th ACM\/SIAM SODA, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"issue":"7","key":"48_CR9","doi-asserted-by":"crossref","first-page":"593","DOI":"10.26421\/QIC5.7-7","volume":"5","author":"A.M. Childs","year":"2005","unstructured":"Childs, A.M., Eisenberg, J.M.: Quantum algorithms for subset finding. Quantum Information and Computation\u00a05(7), 593\u2013604 (2005)","journal-title":"Quantum Information and Computation"},{"key":"48_CR10","first-page":"212","volume-title":"Proc. of 28th ACM STOC","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. of 28th ACM STOC, pp. 212\u2013219. ACM Press, New York (1996)"},{"key":"48_CR11","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":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF03037306","volume":"21","author":"K. Iwama","year":"2003","unstructured":"Iwama, K., Kawachi, A.: A new quantum claw-finding algorithm for three functions. New Generation Computing\u00a021(4), 319\u2013327 (2003)","journal-title":"New Generation Computing"},{"key":"48_CR13","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. In: Proc. 16th ACM\/SIAM SODA, pp. 1109\u20131117 (2005)"},{"issue":"5","key":"48_CR14","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"48_CR15","first-page":"32","volume-title":"Proc. 45th IEEE FOCS","author":"M. Szegedy","year":"2004","unstructured":"Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: Proc. 45th IEEE FOCS, pp. 32\u201341. IEEE Computer Society Press, Los Alamitos (2004)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T14:10:58Z","timestamp":1629555058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}