We prove that for every parity decision tree of depth $d$ on $n$ variables, the sum of absolute values of Fourier coefficients at level $\ell$ is at most $d^{\ell/2} \cdot O(\ell \cdot \log(n))^\ell$. Our result is nearly tight for small values of $\ell$ and extends a previous Fourier bound for standard decision trees by Sherstov, Storozhenko, and Wu (STOC, 2021). As an application of our Fourier bounds, using the results of Bansal and Sinha (STOC, 2021), we show that the $k$-fold Forrelation problem has (randomized) parity decision tree complexity $\tilde{\Omega}\left(n^{1-1/k}\right)$, while having quantum query complexity $\lceil k/2\rceil$. Our proof follows a random-walk approach, analyzing the contribution of a random path in the decision tree to the level-$\ell$ Fourier expression. To carry the argument, we apply a careful cleanup procedure to the parity decision tree, ensuring that the value of the random walk is bounded with high probability. We observe that step sizes for the level-$\ell$ walks can be computed by the intermediate values of level $\le \ell-1$ walks, which calls for an inductive argument. Our approach differs from previous proofs of Tal (FOCS, 2020) and Sherstov, Storozhenko, and Wu (STOC, 2021) that relied on decompositions of the tree. In particular, for the special case of standard decision trees we view our proof as slightly simpler and more intuitive. In addition, we prove a similar bound for noisy decision trees of cost at most $d$ -- a model that was recently introduced by Ben-David and Blais (FOCS, 2020).
翻译:我们证明,对于每棵平价决策树,每棵深度为$美元变量的美元,Fleier系数绝对值的绝对值在美元值为$@ell/2}\cdot O(ell\cdot\log(n))\ ⁇ ell$ell美元。我们的结果对于小值美元几乎是紧的,而对于标准决策树,Sherstov、Storozhenko和Wu(STOC,2021),则是Freier值的绝对值。作为我们Freier值的最小值应用,使用Bansal和Sinha(STOC,2021)的结果,我们显示,美元值的Fourer值绝对值绝对值的绝对值在最高值 Oxlight Orights(randified) 树平价复杂 $\\\ collear\ kreleft\\\ kreaffright(n\ kreax) 美元,我们的标准的数值在20-look 方法上是随机分析决定路径方法,我们在四元值的特殊值。(我们用Serview laxxxral laxx) 水平上,我们最精确的排序的概率的概率, 水平可以证明, 20xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx。