{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:07Z","timestamp":1770994087925,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228233","type":"print"},{"value":"9783540286295","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_65","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"827-838","source":"Crossref","is-referenced-by-count":4,"title":["An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation"],"prefix":"10.1007","author":[{"given":"Harumichi","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Yamakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"L.M. Adleman","year":"1997","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum computability. SIAM J. Comput.\u00a026, 1524\u20131540 (1997)","journal-title":"SIAM J. Comput."},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: A better lower bound for quantum algorithms searching an ordered list. In: Proc. 40th FOCS, pp. 352\u2013357 (1999)","DOI":"10.1109\/SFFCS.1999.814606"},{"key":"65_CR3","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. Comput. System Sci.\u00a064, 750\u2013767 (2002)","journal-title":"J. Comput. System Sci."},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Polynomial degree vs. quantum query complexity. In: Proc. 44th FOCS, pp. 230\u2013240 (2003)","DOI":"10.1109\/SFCS.2003.1238197"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"Barnum, H., Saks, M., Szegedy, M.: Quantum query complexity and semidefinite programming. In: Proc. 18th CCC, pp. 179\u2013193 (2003)","DOI":"10.1109\/CCC.2003.1214419"},{"key":"65_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":"65_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01276436","volume":"2","author":"R. Beigel","year":"1992","unstructured":"Beigel, R., Feigenbaum, J.: On being incoherent without being very hard. Comput. Complex.\u00a02, 1\u201317 (1992)","journal-title":"Comput. Complex."},{"key":"65_CR8","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput.\u00a026, 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. In: Proc. 21st STOC, pp. 86\u201397 (1989)","DOI":"10.1145\/73007.73015"},{"key":"65_CR10","doi-asserted-by":"crossref","unstructured":"Buhrman, H., van Dam, W.: Bounded quantum query complexity. In: Proc. 14th CCC, pp. 149\u2013157 (1999)","DOI":"10.1109\/CCC.1999.766273"},{"key":"65_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(99)00069-1","volume":"70","author":"H. Buhrman","year":"1999","unstructured":"Buhrman, H., de Wolf, R.: A lower bound of quantum search for an ordered list. Inform. Process. Lett.\u00a070, 205\u2013209 (1999)","journal-title":"Inform. Process. Lett."},{"key":"65_CR12","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: A limit on the speed of quantum computation for insertion into an ordered list, See ArXiv quant-ph\/9812057"},{"key":"65_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/s000370050009","volume":"7","author":"J. Feigenbaum","year":"1998","unstructured":"Feigenbaum, J., Fortnow, L., Laplante, S., Naik, A.: On coherence, random-selfreducibility, and self-correction. Comput. Complex.\u00a07, 174\u2013191 (1998)","journal-title":"Comput. Complex."},{"key":"65_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00453-002-0976-3","volume":"34","author":"P. H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., Neerbek, J., Shi, Y.: Quantum lower bound of ordered searching, sorting, and element distinctness. Algorithmica\u00a034, 429\u2013448 (2002)","journal-title":"Algorithmica"},{"key":"65_CR15","doi-asserted-by":"crossref","unstructured":"Laplante, S., Magniez, F.: Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. To appear in Proc. 19th CCC (2004)","DOI":"10.1109\/CCC.2004.1313852"},{"key":"65_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2004.02.005","volume":"90","author":"H. Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: Polynomial time quantum computation with advice. Inform. Process. Lett.\u00a090, 195\u2013204 (2004)","journal-title":"Inform. Process. Lett."},{"key":"65_CR17","unstructured":"Trakhtenbrot, B.: On autoreducibility. Doklady Akad. Nauk. SSSR\u00a0192, 1224\u20131227 (1970), English translation in Soviet Math. Dokl. 11, 814\u2013817 (1970)"},{"key":"65_CR18","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1142\/S0129054103002047","volume":"14","author":"T. Yamakami","year":"2003","unstructured":"Yamakami, T.: Analysis of quantum functions. International Journal of Foundations of Computer Science\u00a014, 815\u2013852 (2003)","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T23:03:17Z","timestamp":1740783797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}