{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:10:57Z","timestamp":1753272657944,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_80","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"919-930","source":"Crossref","is-referenced-by-count":4,"title":["Unbounded-Error Quantum Query Complexity"],"prefix":"10.1007","author":[{"given":"Ashley","family":"Montanaro","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"}]}],"member":"297","reference":[{"key":"80_CR1","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":"80_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0020-0190(99)00079-4","volume":"71","author":"A. Ambainis","year":"1999","unstructured":"Ambainis, A.: A note on quantum black-box complexity of almost all Boolean functions. Inform. Process. Lett.\u00a071, 5\u20137 (1999)","journal-title":"Inform. Process. Lett."},{"key":"80_CR3","series-title":"Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The probabilistic method. Discrete Mathematics and Optimization. Wiley Interscience, Hoboken (2000)"},{"key":"80_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01215346","volume":"14","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Beigel, R., Furst, M., Rudich, S.: The expressive power of voting polynomials. Combinatorica\u00a014, 1\u201314 (1994)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity. In: Proc. 27th FOCS, pp. 303\u2013312 (1986)","key":"80_CR5","DOI":"10.1109\/SFCS.1986.15"},{"key":"80_CR6","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. J. ACM\u00a048, 778\u2013797 (2001)","journal-title":"J. ACM"},{"key":"80_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01263422","volume":"4","author":"R. Beigel","year":"1994","unstructured":"Beigel, R.: Perceptrons, PP, and the polynomial hierarchy. Comput. Complexity\u00a04, 339\u2013349 (1994)","journal-title":"Comput. Complexity"},{"key":"80_CR8","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. Comput.\u00a026, 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proc. 30th STOC, pp. 63\u201368 (1998)","key":"80_CR9","DOI":"10.1145\/276698.276713"},{"doi-asserted-by":"crossref","unstructured":"Buhrman, H., Vereshchagin, N., de Wolf, R.: On computation and communication with small bias. In: Proc. 22nd CCC, pp. 24\u201332 (2007)","key":"80_CR10","DOI":"10.1109\/CCC.2007.18"},{"doi-asserted-by":"crossref","unstructured":"van Dam, W.: Quantum oracle interrogation: getting all information for almost half the price. In: Proc. 39th FOCS, pp. 362\u2013367 (1998)","key":"80_CR11","DOI":"10.1109\/SFCS.1998.743486"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.A.: Extremal properties of polynomial threshold functions. In: Proc. 18th CCC, pp. 3\u201312 (2003)","key":"80_CR12","DOI":"10.1109\/CCC.2003.1214406"},{"key":"80_CR13","doi-asserted-by":"publisher","first-page":"5442","DOI":"10.1103\/PhysRevLett.81.5442","volume":"81","author":"E. Farhi","year":"1998","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: A limit on the speed of quantum computation in determining parity. Phys. Rev. Lett.\u00a081, 5442\u20135444 (1998)","journal-title":"Phys. Rev. Lett."},{"key":"80_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3","volume":"65","author":"J. Forster","year":"2002","unstructured":"Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci.\u00a065, 612\u2013625 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"80_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/11821069_57","volume-title":"Mathematical Foundations of Computer Science 2006","author":"F. Gall Le","year":"2006","unstructured":"Le Gall, F.: Quantum weakly nondeterministic communication complexity. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 658\u2013669. Springer, Heidelberg (2006)"},{"key":"80_CR16","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(90)90027-I","volume":"41","author":"B. Halstenberg","year":"1990","unstructured":"Halstenberg, B., Reischuk, R.: Relations between communication complexity classes. J. Comput. Syst. Sci.\u00a041, 402\u2013429 (1990)","journal-title":"J. Comput. Syst. Sci."},{"key":"80_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-73420-8_12","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Nishimura, H., Raymond, R., Yamashita, S.: Unbounded-error one-way classical and quantum communication complexity. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 110\u2013121. Springer, Heidelberg (2007)"},{"key":"80_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-77120-3_11","volume-title":"Algorithms and Computation","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Nishimura, H., Raymond, R., Yamashita, S.: Unbounded-error classical and quantum communication complexity. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 100\u2013111. Springer, Heidelberg (2007)"},{"key":"80_CR19","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0097539702405620","volume":"37","author":"H. Klauck","year":"2007","unstructured":"Klauck, H.: Lower bounds for quantum communication complexity. SIAM J. Comput.\u00a037, 20\u201346 (2007)","journal-title":"SIAM J. Comput."},{"key":"80_CR20","doi-asserted-by":"publisher","first-page":"52305","DOI":"10.1103\/PhysRevA.63.052305","volume":"63","author":"S. Massar","year":"2001","unstructured":"Massar, S., Bacon, D., Cerf, N., Cleve, R.: Classical simulation of quantum entanglement without local hidden variables. Phys. Rev. A\u00a063, 052305 (2001)","journal-title":"Phys. Rev. A"},{"key":"80_CR21","volume-title":"Perceptrons","author":"M.L. Minsky","year":"1988","unstructured":"Minsky, M.L., Papert, S.A.: Perceptrons. MIT Press, Cambridge (1988)"},{"key":"80_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R. Paturi","year":"1986","unstructured":"Paturi, R., Simon, J.: Probabilistic communication complexity. J. Comput. Syst. Sci.\u00a033, 106\u2013123 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"80_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1070\/IM2003v067n01ABEH000422","volume":"67","author":"A.A. Razborov","year":"2003","unstructured":"Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izvestiya Math. (English version)\u00a067, 145\u2013149 (2003)","journal-title":"Izvestiya Math. (English version)"},{"doi-asserted-by":"crossref","unstructured":"Sherstov, A.: Halfspace matrices. In: Proc. 22nd CCC, pp. 83\u201395 (2007)","key":"80_CR24","DOI":"10.1109\/CCC.2007.11"},{"unstructured":"de Wolf, R.: Quantum Computing and Communication Complexity, University of Amsterdam (2001)","key":"80_CR25"},{"key":"80_CR26","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/S0097539702407345","volume":"32","author":"R. Wolf de","year":"2003","unstructured":"de Wolf, R.: Nondeterministic quantum query and communication complexities. SIAM J. Comput.\u00a032, 681\u2013699 (2003)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T03:20:35Z","timestamp":1738812035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}