{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:40Z","timestamp":1740137260766,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100011447","name":"Science and Technology Department of Henan Province","doi-asserted-by":"publisher","award":["13337"],"award-info":[{"award-number":["13337"]}],"id":[{"id":"10.13039\/501100011447","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11128-020-02839-7","type":"journal-article","created":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T09:10:40Z","timestamp":1604394640000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum algorithms for the Goldreich\u2013Levin learning problem"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8375-9519","authenticated-orcid":false,"given":"Hongwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,3]]},"reference":[{"key":"2839_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. Ser. A 400, 97\u2013117 (1985)","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"2839_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A 439, 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"2839_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. Ser. A 454, 339\u2013354 (1998)","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"2839_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"2839_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein,\u00a0E., Vazirani,\u00a0U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM Press, pp. 11\u201320 (1993)","DOI":"10.1145\/167088.167097"},{"issue":"5","key":"2839_CR6","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"key":"2839_CR7","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: ACM STOC 1996, ACM, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"2839_CR8","doi-asserted-by":"crossref","unstructured":"Kaplan,\u00a0M., Leurent,\u00a0G., Leverrier,\u00a0A., Naya-Plasencia,\u00a0M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.), CRYPTO 2016, Part II, LNCS 9815, pp. 207\u2013237 (2016)","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"2839_CR9","doi-asserted-by":"crossref","unstructured":"Jaques,\u00a0S., Naehrig,\u00a0M., Roetteler,\u00a0M., Virdia,\u00a0F.: Implementing grover oracles for quantum key search on AES and LowMC. In: Canteaut, A., Ishai, Y. (eds.), EUROCRYPT 2020, LNCS 12106, pp. 280\u2013310 (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"2839_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean functions. Cambridge University Press, London (2014)"},{"key":"2839_CR11","unstructured":"Bellare, M.: The Golereich-levin Theorem (1999). http:\/\/www-cse.ucsd.edu\/users\/mihir\/"},{"key":"2839_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1999)","DOI":"10.1007\/978-3-662-12521-2"},{"key":"2839_CR13","doi-asserted-by":"crossref","unstructured":"Adcock, M., Cleve, R.: A quantum Goldreich\u2013Levin theorem with cryptographic applications. In: STACS, pp. 323\u2013334 (2002)","DOI":"10.1007\/3-540-45841-7_26"},{"issue":"5","key":"2839_CR14","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ipl.2005.01.016","volume":"97","author":"M Adcock","year":"2006","unstructured":"Adcock, M., Cleve, R., Iwama, K., Putra, R.: Quantum lower bounds for the Goldreich\u2013Levin problem. Inf. Process. Lett. 97(5), 208\u2013211 (2006)","journal-title":"Inf. Process. Lett."},{"key":"2839_CR15","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes (2008)"},{"issue":"1","key":"2839_CR16","first-page":"1","volume":"2010","author":"A Montanaro","year":"2010","unstructured":"Montanaro, A., Osborne, T.J.: Quantum boolean functions. Chic. J. Theor. Comput. Sci. 2010(1), 1\u201345 (2010)","journal-title":"Chic. J. Theor. Comput. Sci."},{"key":"2839_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s11128-019-2303-9","volume":"18","author":"J Cui","year":"2019","unstructured":"Cui, J., Guo, J., Xu, L., Li, M.: Quantum algorithms for learning Walsh spectra of multi-output Boolean functions. Quantum Inf. Process. 18, 180 (2019)","journal-title":"Quantum Inf. Process."},{"key":"2839_CR18","doi-asserted-by":"publisher","first-page":"062329","DOI":"10.1103\/PhysRevA.84.062329","volume":"84","author":"M Hillery","year":"2011","unstructured":"Hillery, M., Andersson, E.: Quantum tests for the linearity and permutation invariance of Boolean functions. Phys. Rev. A 84, 062329 (2011)","journal-title":"Phys. Rev. A"},{"key":"2839_CR19","doi-asserted-by":"crossref","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Statistical Association Journal, pp. 13\u201330 (1963)","DOI":"10.1080\/01621459.1963.10500830"},{"key":"2839_CR20","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., et al.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457 (1995)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02839-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-020-02839-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02839-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T08:44:17Z","timestamp":1606207457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-020-02839-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2839"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02839-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"9 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"395"}}