{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T05:16:35Z","timestamp":1739078195254,"version":"3.37.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1007\/bf03037306","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T02:52:36Z","timestamp":1240541556000},"page":"319-327","source":"Crossref","is-referenced-by-count":1,"title":["A new quantum claw-finding algorithm for three functions"],"prefix":"10.1007","volume":"21","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Akinori","family":"Kawachi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037306_CR1","doi-asserted-by":"crossref","unstructured":"Biron, D., Biham, O., Biham, E., Grassl, M. and Lidar, D., \u201cGeneralized Grover Search Algorithm for Arbitrary Initial Amplitude,\u201d LANL preprint, http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9801066, 1998.","DOI":"10.1007\/3-540-49208-9_10"},{"key":"BF03037306_CR2","doi-asserted-by":"crossref","unstructured":"Boyer, M., Brassard, G., Hoyer, P. and Tapp, A., \u201cTight Bounds on quantum searching,\u201d Fortschritte Der Physik,46, LANL preprint, pp. 493\u2013505, 1998. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9605034.","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"BF03037306_CR3","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Durr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M. and Wolf, R., \u201cQuantum Algorithm for Element Distinctness,\u201d inProc. of 16th IEEE Conference on Computational Complexity, pp. 131\u2013137, 2001. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/0007016, 2000.","DOI":"10.1109\/CCC.2001.933880"},{"key":"BF03037306_CR4","unstructured":"Brassard, G., Hoyer, P., Mosca, M. and Tapp, A., \u201cQuantum Amplitude Amplification and Estimation,\u201dQuantum Computation and Quantum Information, A Millenium Volume, AMS Contemporary Mathematics Series, LANL preprint, 2000. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/005055."},{"key":"BF03037306_CR5","doi-asserted-by":"crossref","unstructured":"Brassard, G., Hoyer, P. and Tapp, A., \u201cQuantum Algorithm for the Collision Problem,\u201d ACM SIGACT News (Cryptology Column),28, pp 14\u201319, LANL preprint, 1997. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/970502, 1997.","DOI":"10.1145\/261342.261346"},{"key":"BF03037306_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P. and Tapp, A., \u201cQuantum Counting,\u201d inProc. of 25th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 1443, pp. 820\u2013831, 1998.","DOI":"10.1007\/BFb0055105"},{"key":"BF03037306_CR7","unstructured":"Chi, D. P. and Kim, J., \u201cQuantum Database Searching by a Single Query,\u201dChaos, Solitons and Fractals, 10, pp. 1689\u20131693, LANL preprint, 1999. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9708005."},{"key":"BF03037306_CR8","unstructured":"D\u00fcrr C. and H\u00f8yer, P., \u201cA Quantum Algorithm for Finding the Minimum,\u201d LANL preprint. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/90607014."},{"key":"BF03037306_CR9","doi-asserted-by":"crossref","unstructured":"Grover, L., \u201cA Fast Quantum Mechanical Algorithm for Database Search,\u201d inProc. of 28th ACM Symposium on Theory of Computing, pp. 212\u2013218, 1996.","DOI":"10.1145\/237814.237866"},{"key":"BF03037306_CR10","doi-asserted-by":"crossref","unstructured":"Grover, L., \u201cRapid Sampling through Quantum Computing,\u201d inProc. of 32th Symposium on Theory of Computing, pp. 618\u2013626, LANL preprint, 2000. http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9912001.","DOI":"10.1145\/335305.335389"},{"key":"BF03037306_CR11","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Sugawara, N. and Tokuyama, T., \u201cQuantum Algorithms for Intersection and Proximity Problems,\u201d inProc. of the 12th International Symposium on Algorithms and Computation, 2001, pp. 148\u2013159, 2001.","DOI":"10.1007\/3-540-45678-3_14"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037306\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T04:39:10Z","timestamp":1739075950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["BF03037306"],"URL":"https:\/\/doi.org\/10.1007\/bf03037306","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}