{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:41Z","timestamp":1725570461420},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_10","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"85-96","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Counterfeit Coin Problems"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harumichi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichi","family":"Teruyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1006\/jcss.2002.1826","volume":"64","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. J.\u00a0Comput.\u00a0Syst.\u00a0Sci.\u00a064, 750\u2013767 (2002)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jcss.2005.06.006","volume":"72","author":"A. Ambainis","year":"2006","unstructured":"Ambainis, A.: Polynomial degree vs. quantum query complexity. J.\u00a0Comput.\u00a0Syst.\u00a0Sci.\u00a072, 220\u2013238 (2006)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sci."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Barnum, H., Saks, M.E., Szegedy, M.: Quantum query complexity and semi-definite programming. In: Proc.\u00a018th CCC, pp. 179\u2013193 (2003)","DOI":"10.1109\/CCC.2003.1214419"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J.\u00a0Comput.\u00a026, 1411\u20131473 (1997)","journal-title":"SIAM J.\u00a0Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte Der Physik\u00a046, 493\u2013505 (1998)","journal-title":"Fortschritte Der Physik"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume. AMS Contemporary Mathematics Series, vol. 305, pp. 53\u201374 (2002)","DOI":"10.1090\/conm\/305\/05215"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89304-2_1","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"W. Dam van","year":"2008","unstructured":"van Dam, W., Shparlinski, I.: Classical and quantum algorithms for exponential congruences. In: Kawano, Y., Mosca, M. (eds.) TQC 2008. LNCS, vol.\u00a05106, pp. 1\u201310. Springer, Heidelberg (2008)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc.\u00a028th STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.2307\/2975353","volume":"102","author":"R.K. Guy","year":"1995","unstructured":"Guy, R.K., Nowakowski, R.J.: Coin-weighing problems. Amer.\u00a0Math.\u00a0Monthly\u00a0102, 164\u2013167 (1995)","journal-title":"Amer.\u00a0Math.\u00a0Monthly"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(94)00232-8","volume":"147","author":"L. Halbeisen","year":"1995","unstructured":"Halbeisen, L., Hungerb\u00fchler, N.: The general counterfeit coin problem. Discrete Mathematics\u00a0147, 139\u2013150 (1995)","journal-title":"Discrete Mathematics"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., Lee, T., \u0160palek, R.: Negative weights make adversaries stronger. In: Proc.\u00a039th STOC, pp. 526\u2013535 (2007)","DOI":"10.1145\/1250790.1250867"},{"key":"10_CR12","first-page":"416","volume":"1009","author":"K. Iwama","year":"2010","unstructured":"Iwama, K., Nishimura, H., Raymond, R., Teruyama, J.: Quantum counterfeit coin problems. arXiv:1009.0416 (2010)","journal-title":"arXiv"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/050639090","volume":"38","author":"S. Laplante","year":"2008","unstructured":"Laplante, S., Magniez, F.: Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. SIAM J.\u00a0Comput.\u00a038, 46\u201362 (2008)","journal-title":"SIAM J.\u00a0Comput."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.dam.2005.03.009","volume":"152","author":"W.A. Liu","year":"2005","unstructured":"Liu, W.A., Zhang, W.G., Nie, Z.K.: Searching for two counterfeit coins with two-arms balance. Discrete Appl.\u00a0Math.\u00a0152, 187\u2013212 (2005)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"10_CR15","doi-asserted-by":"publisher","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.\u00a0Comput.\u00a037, 413\u2013424 (2007)","journal-title":"SIAM J.\u00a0Comput."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.2307\/2689732","volume":"50","author":"B. Manvel","year":"1977","unstructured":"Manvel, B.: Counterfeit coin problems. Mathematics Magazine\u00a050, 90\u201392 (1977)","journal-title":"Mathematics Magazine"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Reichardt, B.: Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function. In: Proc.\u00a050th FOCS, pp. 544\u2013551 (2009)","DOI":"10.1109\/FOCS.2009.55"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Reichardt, B.: Reflections for quantum query algorithms. arXiv:1005.1601 (2010)","DOI":"10.1137\/1.9781611973082.44"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2006.v002a001","volume":"2","author":"R. \u0160palek","year":"2006","unstructured":"\u0160palek, R., Szegedy, M.: All quantum adversary methods are equivalent. Theory of Computing\u00a02, 1\u201318 (2006)","journal-title":"Theory of Computing"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1103\/PhysRevA.58.1822","volume":"58","author":"B.M. Terhal","year":"1998","unstructured":"Terhal, B.M., Smolin, J.A.: Single quantum querying of a database. Phys. Rev. A\u00a058, 1822\u20131826 (1998)","journal-title":"Phys. Rev. A"},{"key":"10_CR21","first-page":"241","volume":"339","author":"S. Zhang","year":"2005","unstructured":"Zhang, S.: On the power of Ambainis\u2019s lower bounds. Theoret.\u00a0Comput.\u00a0Sci.\u00a0339, 241\u2013256 (2005)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:28Z","timestamp":1559836168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}