{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:11:41Z","timestamp":1780456301705,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61572532"],"award-info":[{"award-number":["61572532"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11128-018-1885-y","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T14:53:06Z","timestamp":1524754386000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Quantum algorithms on Walsh transform and Hamming distance for Boolean functions"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhengwei","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daowen","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guangya","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"1885_CR1","volume-title":"Applications of Walsh and Related Functions","author":"KG Beauchamp","year":"1984","unstructured":"Beauchamp, K.G.: Applications of Walsh and Related Functions. Academic Press, New York (1984)"},{"key":"1885_CR2","volume-title":"Boolean Functions for Cryptography and Error Correcting Codes","author":"C Carlet","year":"2007","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes. Cambridge University Press, Cambridge (2007)"},{"issue":"3","key":"1885_CR3","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1109\/TIT.2014.2300067","volume":"60","author":"WG Zhang","year":"2014","unstructured":"Zhang, W.G., Pasalic, E.: Constructions of resilient S-boxes with strictly almost optimal nonlinearity through disjoint linear codes. IEEE Trans. Inf. Theory 60(3), 1638\u20131651 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1885_CR4","doi-asserted-by":"publisher","first-page":"3656","DOI":"10.1109\/TIT.2008.926360","volume":"54","author":"S Mesnager","year":"2008","unstructured":"Mesnager, S.: Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity. IEEE Trans. Inf. Theory 54(8), 3656\u20133662 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1885_CR5","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/18.556674","volume":"42","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Coppersmith, D., Hastad, J., et al.: Linearity testing in characteristic two. IEEE Trans. Inf. Theory 42(6), 1781\u20131795 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1885_CR6","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"1885_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/13092770X","volume":"45","author":"D Chakrabarty","year":"2016","unstructured":"Chakrabarty, D., Seshadhri, C.: An o(n) monotonicity tester for Boolean functions over the hypercube. SIAM J. Comput. 45(2), 461\u2013472 (2016)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1885_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L Grover","year":"1997","unstructured":"Grover, L.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"1885_CR9","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1885_CR10","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Ambainis, A.: Forrelation: a problem that optimally separates quantum from classical computing. In: Proceedings of the 47th Annual ACM on Symposium on Theory of Computing, ACM, pp. 307\u2013316 (2015)","DOI":"10.1145\/2746539.2746547"},{"key":"1885_CR11","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Balodis, K., Belovs, A., et al.: Separations in query complexity based on pointer functions. In: Proceedings of the 48th Annual ACM on Symposium on Theory of Computing, ACM, pp. 800\u2013813 (2016)","DOI":"10.1145\/2897518.2897524"},{"issue":"1","key":"1885_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., De Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1885_CR13","first-page":"215","volume":"11","author":"A Drucker","year":"2011","unstructured":"Drucker, A., Wolf, R.D.: Uniform approximation by (quantum) polynomials. Quantum Inf. Comput. 11(3), 215\u2013225 (2011)","journal-title":"Quantum Inf. Comput."},{"key":"1885_CR14","unstructured":"Li, H.W., Yang, L.: Quantum algorithm for the finding of Boolean functions linear structures. arXiv:1404.0611 [quant-ph], 2 April (2014)"},{"issue":"5","key":"1885_CR15","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. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"1885_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., et al.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"1885_CR17","doi-asserted-by":"crossref","unstructured":"Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. In: Proceedings of the 31th annual ACM symposium on Theory of computing, ACM, pp. 384\u2013393 (1999)","DOI":"10.1145\/301250.301349"},{"issue":"6","key":"1885_CR18","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s11128-015-0954-8","volume":"14","author":"HW Li","year":"2015","unstructured":"Li, H.W., Yang, L.: A quantum algorithm for approximating the influences of Boolean functions and its applications. Quantum Inf. Process. 14(6), 1787\u20131797 (2015)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"1885_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s12095-015-0156-3","volume":"8","author":"K Chakraborty","year":"2016","unstructured":"Chakraborty, K., Maitra, S.: Application of Grovers algorithm to check non-resiliency of a Boolean function. Cryptogr. Commun. 8(3), 401\u2013413 (2016)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1885_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2590772","volume":"61","author":"A De","year":"2014","unstructured":"De, A., Diakonikolas, I., Feldman, V., et al.: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. J. ACM 61(2), 11 (2014)","journal-title":"J. ACM"},{"issue":"29","key":"1885_CR21","doi-asserted-by":"publisher","first-page":"8441","DOI":"10.1088\/1751-8113\/40\/29\/017","volume":"40","author":"SL Braunstein","year":"2007","unstructured":"Braunstein, S.L., Choi, B.S., Ghosh, S., et al.: Exact quantum algorithm to distinguish Boolean functions of different weights. J. Phys. A Math. Theor. 40(29), 8441\u20138454 (2007)","journal-title":"J. Phys. A Math. Theor."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1885-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1885-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1885-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T23:24:30Z","timestamp":1751585070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1885-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,26]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1885"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1885-y","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,26]]},"assertion":[{"value":"13 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"139"}}