Abstract
We investigate the influences of variables on a Boolean function \(f\) based on the quantum Bernstein–Vazirani algorithm. A previous paper (Floess et al. in Math Struct Comput Sci 23:386, 2013) has proved that if an \(n\)-variable Boolean function \(f(x_1,\ldots ,x_n)\) does not depend on an input variable \(x_i\), using the Bernstein–Vazirani circuit for \(f\) will always output \(y\) that has a 0 in the \(i\)th position. We generalize this result and show that, after running this algorithm once, the probability of getting a 1 in each position \(i\) is equal to the dependence degree of \(f\) on the variable \(x_i\), i.e., the influence of \(x_i\) on \(f\). Based on this, we give an approximation algorithm to evaluate the influence of any variable on a Boolean function. Next, as an application, we use it to study the Boolean functions with juntas and construct probabilistic quantum algorithms to learn certain Boolean functions. Compared with the deterministic algorithms given by Floess et al., our probabilistic algorithms are faster.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Floess, D., Andersson, E., Hillery, M.: Quantum algorithms for testing and learning Boolean functions. Math. Struct. Comput. Sci. 23(2), 386–398 (2013)
Ben-Or, M., Linial, N.: Collective coin flipping. In: Micali, S. (ed.) Randomness and computation, pp. 91–115. Academic press, New York (1989)
Hatami, H.: A structure theorem for Boolean functions with small total influences. Ann. Math. 176(1), 509–533 (2012) also arXiv:1008.1021v3 [math.CO] 12 Nov 2011
Kahn, J., Kalai G., Linial, N.: The influence of variables on Boolean functions. in: Proceedings of 29th FOCS, pp. 68–80 (1988)
Wolf, R.D.: A brief introduction to fourier analysis on the Boolean cube. TCGS 1, 1–20 (2008). http://theoryofcomputing.org
Gavinsky, D., Kempe, J., Kerenidis, I., Raz R., Wolf, R.d.: Exponential separation for one-way quantum communication complexity, with applications to cryptograph. SIAM J. Comput. 38(5), 1695–1708 (2008). arXiv:quant-ph/0611209v3
Bernstein, E., Vazirani, U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 11–20. ACM Press, New York (1993)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. A 454, 339–354 (1998)
Dasgupta, S., Biswas, A., Agarwal, G.S.: Implementing Deutsch–Jozsa algorithm using light shifts and atomic ensembles. Phys. Rev. A 71, 012333 (2005)
Wang, H.F., Zhang, S.: Implementation of n-qubit Deutsch–Jozsa algorithm using resonant interaction in cavity QED. Chin. Phys. B. 17(4), 1165–1173 (2008)
Hillery, M., Anderson, E.: Quantum tests for the linearity and permutation invariance of Boolean functions. Phys. Rev. A 84, 062326 (2011)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. Am. Stat. Assoc. J., 58(301), 13–30 (1963)
O’Donnell, R.: Some topics in analysis of Boolean functions. In: STOC’08, Victoria, BC, Canada. Invited Paper 17–20 (2008)
Li, H.W., Yang, L.: Quantum algorithm for the finding of Boolean function’s linear structures. arXiv:1404.0611 [quant-ph], 2 Apr 2014
Acknowledgments
This work was supported by the National Natural Science Foundation of China under Grant No. 61173157.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, H., Yang, L. A quantum algorithm for approximating the influences of Boolean functions and its applications. Quantum Inf Process 14, 1787–1797 (2015). https://doi.org/10.1007/s11128-015-0954-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-015-0954-8