{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:37Z","timestamp":1740137257797,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:00:00Z","timestamp":1598227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:00:00Z","timestamp":1598227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008628","name":"Ministry of Electronics and Information technology","doi-asserted-by":"publisher","award":["4(9)\/2019-ITEA"],"award-info":[{"award-number":["4(9)\/2019-ITEA"]}],"id":[{"id":"10.13039\/501100008628","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,9]]},"DOI":"10.1007\/s11128-020-02817-z","type":"journal-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T08:03:54Z","timestamp":1598256234000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A quantum algorithm to estimate the Gowers $$U_2$$ norm and linearity testing of Boolean functions"],"prefix":"10.1007","volume":"19","author":[{"given":"C. A.","family":"Jothishwaran","sequence":"first","affiliation":[]},{"given":"Anton","family":"Tkachenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7329-7349","authenticated-orcid":false,"given":"Sugata","family":"Gangopadhyay","sequence":"additional","affiliation":[]},{"given":"Constanza","family":"Riera","sequence":"additional","affiliation":[]},{"given":"Pantelimon","family":"St\u0103nic\u0103","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,24]]},"reference":[{"key":"2817_CR1","doi-asserted-by":"publisher","unstructured":"Bera, D., Maitra, S., Tharrmashastha, S.: Efficient quantum algorithms related to autocorrelation spectrum. In: Hao, F., Ruj, S., Gupta, S.S. (eds.) Progress in Cryptology\u2014INDOCRYPT 2019\u201420th International Conference on Cryptology in India, Hyderabad, India, December 15\u201318, 2019, LNCS 11898, pp. 415\u2013432. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_21","DOI":"10.1007\/978-3-030-35423-7_21"},{"issue":"3","key":"2817_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"2817_CR3","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1109\/TIT.2007.915704","volume":"54","author":"C Carlet","year":"2008","unstructured":"Carlet, C.: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inf. Theory 54(3), 1262\u20131272 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2817_CR4","unstructured":"Chen, V.Y.: The Gowers\u2019 norm in the testing of Boolean functions. Ph.D. thesis, Massachusetts Institute of Technology (2009)"},{"key":"2817_CR5","volume-title":"Cryptographic Boolean Functions and Applications","author":"T Cusick","year":"2017","unstructured":"Cusick, T., St\u0103nic\u0103, P.: Cryptographic Boolean Functions and Applications, 2nd edn. Elsevier, Amsterdam (2017)","edition":"2"},{"key":"2817_CR6","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":"2817_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"2817_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"WT Gowers","year":"2001","unstructured":"Gowers, W.T.: A new proof of Szemer\u00e9di\u2019s theorem. Geom. Funct. Anal. GAFA 11(3), 465\u2013588 (2001)","journal-title":"Geom. Funct. Anal. GAFA"},{"key":"2817_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0013091505000325","volume":"51","author":"B Green","year":"2008","unstructured":"Green, B., Tao, T.: An inverse theorem for the Gowers $${U}_3$$ norm. Proc. Edinb. Math. Soc. 51, 75\u2013153 (2008)","journal-title":"Proc. Edinb. Math. Soc."},{"key":"2817_CR10","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). https:\/\/doi.org\/10.1103\/PhysRevA.84.062329","journal-title":"Phys. Rev. A"},{"key":"2817_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2817_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transforms and learnability. J. ACM 40(3), 607\u2013620 (1993)","journal-title":"J. ACM"},{"issue":"02","key":"2817_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0219749905000980","volume":"03","author":"S Maitra","year":"2005","unstructured":"Maitra, S., Mukhopadhyay, P.: The Deutsch\u2013Jozsa algorithm revisited in the domain of cryptographically significant Boolean functions. Int. J. Quantum Inf. 03(02), 359\u2013370 (2005)","journal-title":"Int. J. Quantum Inf."},{"key":"2817_CR14","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2011","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information, 10th edn. Cambridge University Press, Cambridge (2011)","edition":"10"},{"key":"2817_CR15","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, Cambridge (2014)"},{"key":"2817_CR16","volume-title":"Quantum Computing: A Gentle Introduction","author":"E Rieffel","year":"2011","unstructured":"Rieffel, E., Polak, W.: Quantum Computing: A Gentle Introduction, 1st edn. The MIT Press, Cambridge (2011)","edition":"1"},{"issue":"11","key":"2817_CR17","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L Valiant","year":"1984","unstructured":"Valiant, L.: A theory of learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"2817_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s11128-018-1885-y","volume":"17","author":"Z Xie","year":"2018","unstructured":"Xie, Z., Qiu, D., Cai, G.: Quantum algorithms on Walsh transform and Hamming distance for Boolean functions. Quantum Inf. Process. 17, 139 (2018)","journal-title":"Quantum Inf. Process."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-020-02817-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T10:53:24Z","timestamp":1723460004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-020-02817-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,24]]},"references-count":18,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2817"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02817-z","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2020,8,24]]},"assertion":[{"value":"11 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"311"}}