English

On the Fourier spectrum of functions on Boolean cubes

Functional Analysis 2017-06-13 v1

Abstract

Let ff be a real-valued, degree-dd Boolean function defined on the nn-dimensional Boolean cube {±1}n\{\pm 1\}^{n}, and f(x)=S{1,,d}f^(S)kSxkf(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k its Fourier-Walsh expansion. The main result states that there is an absolute constant C>0C >0 such that the 2d/(d+1)\ell_{2d/(d+1)}-sum of the Fourier coefficients of f:{±1}n[1,1]f:\{\pm 1\}^{n} \rightarrow [-1,1] is bounded by Cdlogd\leq C^{\sqrt{d \log d}}. It was recently proved that a similar result holds for complex-valued polynomials on the nn-dimensional poly torus Tn\mathbb{T}^n, but that in contrast to this a replacement of the nn-dimensional torus Tn\mathbb{T}^n by nn-dimensional cube [1,1]n[-1, 1]^n leads to a substantially weaker estimate. This in the Boolean case forces us to invent novel techniques which differ from the ones used in the complex or real case. We indicate how our result is linked with several questions in quantum information theory.

Keywords

Cite

@article{arxiv.1706.03670,
  title  = {On the Fourier spectrum of functions on Boolean cubes},
  author = {Andreas Defant and Mieczysław Mastyło and Antonio Pérez},
  journal= {arXiv preprint arXiv:1706.03670},
  year   = {2017}
}

Comments

25 pages