{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:26:06Z","timestamp":1737523566857,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_86","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"1065-1080","source":"Crossref","is-referenced-by-count":4,"title":["Separating Quantum and Classical Learning"],"prefix":"10.1007","author":[{"given":"Rocco A.","family":"Servedio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"86_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning 2 (1988), 319\u2013342.","journal-title":"Machine Learning"},{"key":"86_CR2","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D. Angluin","year":"1995","unstructured":"D. Angluin and M. Kharitonov. When won\u2019t membership queries help? J. Comp. Syst. Sci. 50 (1995), 336\u2013355.","journal-title":"J. Comp. Syst. Sci."},{"key":"86_CR3","doi-asserted-by":"crossref","unstructured":"R. Beals, H. Buhrman, R. Cleve, M. Mosca and R. de Wolf. Quantum lower bounds by polynomials, in \u201cProc. 39th Symp. on Found. of Comp. Sci.,\u201d (1998), 352\u2013361.","DOI":"10.1109\/SFCS.1998.743485"},{"issue":"5","key":"86_CR4","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C. Bennett","year":"1997","unstructured":"C. Bennett, E. Bernstein, G. Brassard and U. Vazirani. Strengths and weaknesses of quantum computing, SIAM J. Comp. 26(5) (1997), 1510\u20131523.","journal-title":"SIAM J. Comp."},{"issue":"5","key":"86_CR5","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"E. Bernstein & U. Vazirani. Quantum complexity theory, SICOMP 26(5) (1997), 1411\u20131473.","journal-title":"SICOMP"},{"issue":"4-5","key":"86_CR6","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":"M. Boyer, G. Brassard, P. H\u2205yer, A. Tapp. Tight bounds on quantum searching, Forschritte der Physik 46(4-5) (1998), 493\u2013505.","journal-title":"Forschritte der Physik"},{"key":"86_CR7","doi-asserted-by":"crossref","unstructured":"G. Brassard, P. H\u2205yer and A. Tapp. Quantum counting, in \u201cProc. 25th Int. Conf. on Automata, Languages and Programming\u201d (1998), 820\u2013831.","DOI":"10.1007\/BFb0055105"},{"key":"86_CR8","doi-asserted-by":"crossref","unstructured":"G. Brassard and P. H\u2205yer. An exact quantum polynomial-time algorithm for Simon\u2019s problem, in \u201cProc. Fifth Israeli Symp. on Theory of Comp. and Systems\u201d (1997), 12\u201323.","DOI":"10.1109\/ISTCS.1997.595153"},{"issue":"3","key":"86_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jcss.1996.0032","volume":"52","author":"N. Bshouty","year":"1996","unstructured":"N. Bshouty, R. Cleve, R. Gavald\u00e0, S. Kannan and C. Tamon. Oracles and queries that are sufficient for exact learning, J. Comput. Syst. Sci. 52(3) (1996), 421\u2013433.","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"86_CR10","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/S0097539795293123","volume":"28","author":"N. Bshouty","year":"1999","unstructured":"N. Bshouty and J. Jackson. Learning DNF over the uniform distribution using a quantum example oracle, SIAM J. Comp. 28(3) (1999), 1136\u20131153.","journal-title":"SIAM J. Comp."},{"key":"86_CR11","doi-asserted-by":"crossref","unstructured":"H. Buhrman, R. Cleve and A. Wigderson. Quantum vs. classical communication and computation, in \u201cProc. 30th Symp. on Theory of Comp.\u201d (1998), 63\u201368.","DOI":"10.1145\/276698.276713"},{"key":"86_CR12","unstructured":"R. Cleve. An introduction to quantum complexity theory, to appear in \u201cCollected Papers on Quantum Computation and Quantum Information Theory,\u201d ed. by C. Macchiavello, G.M. Palma and A. Zeilinger."},{"key":"86_CR13","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation, Proc. Royal Society of London A, 439 (1992), 553\u2013558.","journal-title":"Proc. Royal Society of London A"},{"key":"86_CR14","doi-asserted-by":"crossref","unstructured":"R. Gavald\u00e0. The complexity of learning with queries, in \u201cProc. Ninth Structure in Complexity Theory Conference\u201d (1994), 324\u2013337.","DOI":"10.1109\/SCT.1994.315791"},{"issue":"4","key":"86_CR15","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions, J. ACM 33(4) (1986), 792\u2013807.","journal-title":"J. ACM"},{"key":"86_CR16","doi-asserted-by":"crossref","unstructured":"L. K. Grover. A fast quantum mechanical algorithm for database search, in \u201cProc. 28th Symp. on Theory of Comp.\u201d (1996), 212\u2013219.","DOI":"10.1145\/237814.237866"},{"issue":"4","key":"86_CR17","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin and M. Luby. A pseudorandom generator from any one-way function, SIAM J. Comp. 28(4) (1999), 1364\u20131396.","journal-title":"SIAM J. Comp."},{"key":"86_CR18","doi-asserted-by":"crossref","unstructured":"T. Heged\u0171s. Generalized teaching dimensions and the query complexity of learning, in \u201cProc. Eighth Conf. on Comp. Learning Theory,\u201c (195), 108\u2013117.","DOI":"10.1145\/225298.225311"},{"issue":"5","key":"86_CR19","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan and D. Wilkins. How many queries are needed to learn? J. ACM 43(5) (1996), 840\u2013862.","journal-title":"J. ACM"},{"issue":"1","key":"86_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata, J. ACM 41(1) (1994), 67\u201395.","journal-title":"J. ACM"},{"issue":"2","key":"86_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudrandom functions, SIAM J. Comp. 17(2) (1988), 373\u2013386.","journal-title":"SIAM J. Comp."},{"key":"86_CR22","doi-asserted-by":"crossref","unstructured":"J. Patarin. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function, in \u201cAdv. in Crypt. \u2014 EUROCRYPT\u2019 92\u201d (1992), 256\u2013266.","DOI":"10.1007\/3-540-47555-9_22"},{"key":"86_CR23","doi-asserted-by":"crossref","unstructured":"J. Pierpzyk. How to construct pseudorandom permutations from single pseudorandom functions. in \u201cAdv. in Crypt. \u2014 EUROCRYPT\u2019 90\u201d (1990), 140\u2013150.","DOI":"10.1007\/3-540-46877-3_12"},{"key":"86_CR24","doi-asserted-by":"crossref","unstructured":"J. Pierpzyk and B. Sadeghiyan. A construction for super pseudorandom permutations from a single pseudorandom function. in \u201cAdv. in Crypt. \u2014 EUROCRYPT\u2019 92\u201d (1992), 267\u2013284.","DOI":"10.1007\/3-540-47555-9_23"},{"key":"86_CR25","doi-asserted-by":"crossref","unstructured":"J. Preskill. Lecture notes on quantum computation (1998). Available at http:\/\/www.theory.caltech.edu\/people\/preskill\/ph229\/","DOI":"10.1142\/9789812385253_0008"},{"key":"86_CR26","unstructured":"R. Servedio and S. Gortler. Quantum versus classical learnability, to appear in \u201cProc. 16th Conf. on Comput. Complex.\u201c (2001)."},{"issue":"5","key":"86_CR27","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp. 26(5) (1997), 1484\u20131509.","journal-title":"SIAM J. Comp."},{"issue":"5","key":"86_CR28","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D. Simon","year":"1997","unstructured":"D. Simon. On the power of quantum computation, SIAM J. Comp. 26(5) (1997), 1474\u20131483.","journal-title":"SIAM J. Comp."},{"key":"86_CR29","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and applications of trapdoor functions, in \u201cProc. 23rd FOCS\u201d (1982), 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"86_CR30","unstructured":"A. Yao. Quantum circuit complexity, in \u201cProc. 34th FOCS\u201d (1993), 352\u2013361."},{"key":"86_CR31","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C. Zalka","year":"1999","unstructured":"C. Zalka. Grover\u2019s quantum searching algorithm is optimal. Physical Review A 60 (1999), 2746\u20132751.","journal-title":"Physical Review A"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_86","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:46Z","timestamp":1737503386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_86","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}