{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:45:34Z","timestamp":1742949934831,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699361"},{"type":"electronic","value":"9783540699378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69937-8_20","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"226-237","source":"Crossref","is-referenced-by-count":0,"title":["Adversary Lower Bounds for Nonadaptive Quantum Algorithms"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Landes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natacha","family":"Portier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Penghui","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"465","volume-title":"Proc. STOC 2004","author":"S. Aaronson","year":"2004","unstructured":"Aaronson, S.: Lower bounds for local search by quantum arguments. In: Proc. STOC 2004, pp. 465\u2013474. ACM Press, New York (2004)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S. Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum Lower Bounds for the Collision and the Element Distinctness Problems. Journal of the ACM\u00a051(4), 595\u2013605 (2004)","journal-title":"Journal of the ACM"},{"issue":"2","key":"20_CR3","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. Comput. Syst. Sci.\u00a072(2), 220\u2013238 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR4","first-page":"266","volume-title":"Proc. STOC 2001","author":"Z. Bar-Yossef","year":"2001","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling Algorithms: lower bounds and applications. In: Proc. STOC 2001, pp. 266\u2013275. ACM Press, New York (2001)"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM\u00a048(4), 778\u2013797 (2001)","journal-title":"Journal of the ACM"},{"issue":"6","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1137\/050644719","volume":"35","author":"C. D\u00fcrr","year":"2006","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput.\u00a035(6), 1310\u20131328 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003)","DOI":"10.1145\/780542.780544"},{"key":"20_CR8","unstructured":"Grover, L.K., Radhakrishnan, J.: Quantum search for multiple items using parallel queries. arXiv (2004)"},{"key":"20_CR9","first-page":"78","volume":"87","author":"P. Hoyer","year":"2005","unstructured":"Hoyer, P., Spalek, R.: Lower bounds on quantum query complexity. EATCS Bulletin\u00a087, 78\u2013103 (2005)","journal-title":"EATCS Bulletin"},{"key":"20_CR10","unstructured":"Koiran, P., Nesme, V., Portier, N.: On the probabilistic query complexity of transitively symmetric problems, http:\/\/perso.ens-lyon.fr\/pascal.koiran"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1007\/11523468_104","volume-title":"Automata, Languages and Programming","author":"P. Koiran","year":"2005","unstructured":"Koiran, P., Nesme, V., Portier, N.: A quantum lower bound for the query complexity of Simon\u2019s problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1287\u20131298. Springer, Heidelberg (2005)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2007.02.057","volume":"380","author":"P. Koiran","year":"2007","unstructured":"Koiran, P., Nesme, V., Portier, N.: The quantum query complexity of abelian hidden subgroup problems. Theoretical Computer Science\u00a0380, 115\u2013126 (2007)","journal-title":"Theoretical Computer Science"},{"key":"20_CR13","unstructured":"Laplante, S., Magniez, F.: Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. SIAM journal on Computing (to appear)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/978-3-540-28629-5_65","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H. Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation (extended abstract). In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 827\u2013838. Springer, Heidelberg (2004)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On the time required to check properties of graphs: A problem. SIGACT News, 15\u201316 (1973)","DOI":"10.1145\/1008299.1008302"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Simon, D.R.: On the power of quantum computation. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 116\u2013123 (1994)","DOI":"10.1109\/SFCS.1994.365701"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1007\/11523468_105","volume-title":"Automata, Languages and Programming","author":"R. Spalek","year":"2005","unstructured":"Spalek, R., Szegedy, M.: All quantum adversary methods are equivalent. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1299\u20131311. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69937-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:10:53Z","timestamp":1738325453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69937-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699361","9783540699378"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69937-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}