Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.11448

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

Published Jun 9, 2026• 0 citations
arXivHTMLPDF

Abstract

We study the query complexity of Boolean functions $f: \{0, 1\}^n \rightarrow \{0, 1\}$ in the noisy query model introduced by Feige, Raghavan, Peleg and Upfal [SICOMP 1994]. In this model, an algorithm can adaptively query the bits of an input vector, but each query result is independently flipped with constant probability $p \in (0, 1/2)$; repeated queries are allowed. The noisy query complexity $\mathsf{N}_p(f)$ of a function $f$ is defined as the minimum expected number of queries needed to compute $f(x)$ with error probability at most $1/3$, for the worst case input $x$. We prove a general lower bound on $\mathsf{N}_p(f)$ based on degree statistics of certain subgraphs of the Boolean hypercube. This is the first general lower bound beyond those implied by the simple observation that $\mathsf{N}_p(f)$ is lower bounded by the randomized query complexity. We show that this recovers (up to a constant factor) most previously known lower bounds on the noisy query complexity of Boolean functions, providing a unified framework for understanding these results and simplifying the proofs in several cases. Furthermore, this resolves in the affirmative an open problem of Gu, Li and Xu [COLT 2025] that $\mathsf{N}_p(f) = Ω(\mathsf{I}(f) \log \mathsf{I}(f))$, where $\mathsf{I}(f)$ denotes the total influence of $f$. We also apply our general lower bound to obtain tight bounds on the noisy query complexity for several new functions.

DOI
10.48550/arxiv.2606.11448

Related papers

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold

Yuzhou Gu, Xin Jun Li, Yinzhan Xu

In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several fundamental problems. Our first contribution is to show that any Boolean function with total influence $Ω(n)$ has noisy query complexity $Θ(n\log n)$. Previous works often focus on specific problems, and it is of great interest to have a characterization of noisy query complexity for general functions. Our result is the first noisy query complexity lower bound of this generality, beyond what was known for random Boolean functions [Reischuk and Schmeltz, FOCS 1991]. Our second contribution is to prove that Graph Connectivity has noisy query complexity $Θ(n^2 \log n)$. In this problem, the goal is to determine whether an undirected graph is connected using noisy edge queries. While the upper bound can be achieved by a simple algorithm, no non-trivial lower bounds were known prior to this work. Last but not least, we determine the exact number of noisy queries (up to lower order terms) needed to solve the $k$-Threshold problem and the Counting problem. The $k$-Threshold problem asks to decide whether there are at least $k$ ones among $n$ bits, given noisy query access to the bits. We prove that $(1\pm o(1)) \frac{n\log (\min\{k,n-k+1\}/δ)}{(1-2p)\log \frac{1-p}p}$ queries are both sufficient and necessary to achieve error probability $δ= o(1)$. Previously, such a result was only known when $\min\{k,n-k+1\}=o(n)$ [Wang, Ghaddar, Zhu and Wang, arXiv 2024]. We also show a similar $(1\pm o(1)) \frac{n\log (\min\{k+1,n-k+1\}/δ)}{(1-2p)\log \frac{1-p}p}$ bound for the Counting problem, where one needs to count the number of ones among $n$ bits given noisy query access and $k$ denotes the answer.

arXiv:2502.04632•Feb 7, 2025•0 citations

Average-Case Lower Bounds for Noisy Boolean Decision Trees

William Evans, Nicholas J. Pippenger

We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuk and Schmeltz) that almost all Boolean functions of n arguments require $\Me(n \log n)$ queries, and strengthens this bound from the worst-case over inputs to the average over inputs. The method also yields bounds for specific Boolean functions in terms of their spectra (their Fourier transforms). The simplest instance of this spectral bound yields the result (previously established by Feige, Peleg, Raghavan, and Upfal) that the parity function of n arguments requires $\Me(n \log n)$ queries and again strengthens this bound from the worst-case over inputs to the average over inputs. In its full generality, the spectral bound applies to the "highly resilient" functions introduced by Chor, Friedman, Goldreich, Hastad, Rudich, and Smolensky, and it yields nonlinear lower bounds whenever the resiliency is asymptotic to the number of arguments.

SIAM Journal on Computing•Jan 1, 1998•19 citations

Lower bounds for noisy Boolean decision trees

William Evans, Nicholas J. Pippenger

We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuck and Schmeltz) that almost all Boolean functions of n arguments require Ω(n log n) queries and strengthens this bound from the worst-case over inputs to the average over inputs. The method also yields bounds for specific Boolean functions in terms of their spectra (their Fourier transforms). The simplest instance of this spectral bound yields the result (previously established by Feige, Peleg, Raghavan and Upfal) that the parity function of n arguments requires Ω(n log n) queries, and again strengthens this bound from the worst-case over inputs to the average over inputs. In its full generality, the spectral bound applies to the "highly resilient" functions introduced by Chor, Friedman, Goldreigh, Hastad, Rudich and Smolensky, and it yields non-linear lower bounds whenever the resiliency is asymptotic to the number of arguments.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 1996•87 citations

Quantum Sabotage Complexity

Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro

Given a Boolean function $f:\{0,1\}^n\to\{0,1\}$, the goal in the usual query model is to compute $f$ on an unknown input $x \in \{0,1\}^n$ while minimizing the number of queries to $x$. One can also consider a "distinguishing" problem denoted by $f_{\mathsf{sab}}$: given an input $x \in f^{-1}(0)$ and an input $y \in f^{-1}(1)$, either all differing locations are replaced by a $*$, or all differing locations are replaced by $\dagger$, and an algorithm's goal is to identify which of these is the case while minimizing the number of queries. Ben-David and Kothari [ToC'18] introduced the notion of randomized sabotage complexity of a Boolean function to be the zero-error randomized query complexity of $f_{\mathsf{sab}}$. A natural follow-up question is to understand $\mathsf{Q}(f_{\mathsf{sab}})$, the quantum query complexity of $f_{\mathsf{sab}}$. In this paper, we initiate a systematic study of this. The following are our main results: $\bullet\;\;$ If we have additional query access to $x$ and $y$, then $\mathsf{Q}(f_{\mathsf{sab}})=O(\min\{\mathsf{Q}(f),\sqrt{n}\})$. $\bullet\;\;$ If an algorithm is also required to output a differing index of a 0-input and a 1-input, then $\mathsf{Q}(f_{\mathsf{sab}})=O(\min\{\mathsf{Q}(f)^{1.5},\sqrt{n}\})$. $\bullet\;\;$ $\mathsf{Q}(f_{\mathsf{sab}}) = Ω(\sqrt{\mathsf{fbs}(f)})$, where $\mathsf{fbs}(f)$ denotes the fractional block sensitivity of $f$. By known results, along with the results in the previous bullets, this implies that $\mathsf{Q}(f_{\mathsf{sab}})$ is polynomially related to $\mathsf{Q}(f)$. $\bullet\;\;$ The bound above is easily seen to be tight for standard functions such as And, Or, Majority and Parity. We show that when $f$ is the Indexing function, $\mathsf{Q}(f_{\mathsf{sab}})=Θ(\mathsf{fbs}(f))$, ruling out the possibility that $\mathsf{Q}(f_{\mathsf{sab}})=Θ(\sqrt{\mathsf{fbs}(f)})$ for all $f$.

arXiv:2408.12595•Leibniz international proceedings in informatics•Jan 1, 2024•1 citation

Weak Parity

Scott Aaronson, Andris Ambainis, Kaspars Balodis +1 more

We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1/eps)) in both cases; and using extremal combinatorics, prove lower bounds of Omega(log n) in the randomized case and Omega(sqrt(log n)) in the quantum case for any eps>0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.

arXiv:1312.0036•Nov 29, 2013•0 citations

Noisy Computing of the Threshold Function

Ziao Wang, Nadim Ghaddar, Banghua Zhu +1 more

Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function using noisy readings of the Boolean variables, where each reading is incorrect with some fixed and known probability $p \in (0,1/2)$. As our main result, we show that it is sufficient to use $(1+o(1)) \frac{n\log \frac{m}δ}{D_{\mathsf{KL}}(p \| 1-p)}$ queries in expectation to compute the $\mathsf{TH}_k$ function with a vanishing error probability $δ= o(1)$, where $m\triangleq \min\{k,n-k+1\}$ and $D_{\mathsf{KL}}(p \| 1-p)$ denotes the Kullback-Leibler divergence between $\mathsf{Bern}(p)$ and $\mathsf{Bern}(1-p)$ distributions. Conversely, we show that any algorithm achieving an error probability of $δ= o(1)$ necessitates at least $(1-o(1))\frac{(n-m)\log\frac{m}δ}{D_{\mathsf{KL}}(p \| 1-p)}$ queries in expectation. The upper and lower bounds are tight when $m=o(n)$, and are within a multiplicative factor of $\frac{n}{n-m}$ when $m=Θ(n)$. In particular, when $k=n/2$, the $\mathsf{TH}_k$ function corresponds to the $\mathsf{MAJORITY}$ function, in which case the upper and lower bounds are tight up to a multiplicative factor of two. Compared to previous work, our result tightens the dependence on $p$ in both the upper and lower bounds.

arXiv:2403.07227•IEEE Transactions on Information Theory•Aug 6, 2026•1 citation
We study the query complexity of Boolean functions f:{0,1}n→{0,1}f: \{0, 1\}^n \rightarrow \{0, 1\}f:{0,1}n→{0,1} in the noisy query model introduced by Feige, Raghavan, Peleg and Upfal [SICOMP 1994]. In this model, an algorithm can adaptively query the bits of an input vector, but each query result is independently flipped with constant probability p∈(0,1/2)p \in (0, 1/2)p∈(0,1/2); repeated queries are allowed. The noisy query complexity Np(f)\mathsf{N}_p(f)Np​(f) of a function fff is defined as the minimum expected number of queries needed to compute f(x)f(x)f(x) with error probability at most 1/31/31/3, for the worst case input xxx. We prove a general lower bound on Np(f)\mathsf{N}_p(f)Np​(f) based on degree statistics of certain subgraphs of the Boolean hypercube. This is the first general lower bound beyond those implied by the simple observation that Np(f)\mathsf{N}_p(f)Np​(f) is lower bounded by the randomized query complexity. We show that this recovers (up to a constant factor) most previously known lower bounds on the noisy query complexity of Boolean functions, providing a unified framework for understanding these results and simplifying the proofs in several cases. Furthermore, this resolves in the affirmative an open problem of Gu, Li and Xu [COLT 2025] that Np(f)=Ω(I(f)log⁡I(f))\mathsf{N}_p(f) = Ω(\mathsf{I}(f) \log \mathsf{I}(f))Np​(f)=Ω(I(f)logI(f)), where I(f)\mathsf{I}(f)I(f) denotes the total influence of fff. We also apply our general lower bound to obtain tight bounds on the noisy query complexity for several new functions.
In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability p∈(0,1/2)p \in (0, 1/2)p∈(0,1/2). In this paper, we obtain tight bounds on the noisy query complexity of several fundamental problems. Our first contribution is to show that any Boolean function with total influence Ω(n)Ω(n)Ω(n) has noisy query complexity Θ(nlog⁡n)Θ(n\log n)Θ(nlogn). Previous works often focus on specific problems, and it is of great interest to have a characterization of noisy query complexity for general functions. Our result is the first noisy query complexity lower bound of this generality, beyond what was known for random Boolean functions [Reischuk and Schmeltz, FOCS 1991]. Our second contribution is to prove that Graph Connectivity has noisy query complexity Θ(n2log⁡n)Θ(n^2 \log n)Θ(n2logn). In this problem, the goal is to determine whether an undirected graph is connected using noisy edge queries. While the upper bound can be achieved by a simple algorithm, no non-trivial lower bounds were known prior to this work. Last but not least, we determine the exact number of noisy queries (up to lower order terms) needed to solve the kkk-Threshold problem and the Counting problem. The kkk-Threshold problem asks to decide whether there are at least kkk ones among nnn bits, given noisy query access to the bits. We prove that (1±o(1))nlog⁡(min⁡{k,n−k+1}/δ)(1−2p)log⁡1−pp(1\pm o(1)) \frac{n\log (\min\{k,n-k+1\}/δ)}{(1-2p)\log \frac{1-p}p}(1±o(1))(1−2p)logp1−p​nlog(min{k,n−k+1}/δ)​ queries are both sufficient and necessary to achieve error probability δ=o(1)δ= o(1)δ=o(1). Previously, such a result was only known when min⁡{k,n−k+1}=o(n)\min\{k,n-k+1\}=o(n)min{k,n−k+1}=o(n) [Wang, Ghaddar, Zhu and Wang, arXiv 2024]. We also show a similar (1±o(1))nlog⁡(min⁡{k+1,n−k+1}/δ)(1−2p)log⁡1−pp(1\pm o(1)) \frac{n\log (\min\{k+1,n-k+1\}/δ)}{(1-2p)\log \frac{1-p}p}(1±o(1))(1−2p)logp1−p​nlog(min{k+1,n−k+1}/δ)​ bound for the Counting problem, where one needs to count the number of ones among nnn bits given noisy query access and kkk denotes the answer.
We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuk and Schmeltz) that almost all Boolean functions of n arguments require $\Me(n \log n)$ queries, and strengthens this bound from the worst-case over inputs to the average over inputs. The method also yields bounds for specific Boolean functions in terms of their spectra (their Fourier transforms). The simplest instance of this spectral bound yields the result (previously established by Feige, Peleg, Raghavan, and Upfal) that the parity function of n arguments requires $\Me(n \log n)$ queries and again strengthens this bound from the worst-case over inputs to the average over inputs. In its full generality, the spectral bound applies to the "highly resilient" functions introduced by Chor, Friedman, Goldreich, Hastad, Rudich, and Smolensky, and it yields nonlinear lower bounds whenever the resiliency is asymptotic to the number of arguments.
We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuck and Schmeltz) that almost all Boolean functions of n arguments require Ω(n log n) queries and strengthens this bound from the worst-case over inputs to the average over inputs. The method also yields bounds for specific Boolean functions in terms of their spectra (their Fourier transforms). The simplest instance of this spectral bound yields the result (previously established by Feige, Peleg, Raghavan and Upfal) that the parity function of n arguments requires Ω(n log n) queries, and again strengthens this bound from the worst-case over inputs to the average over inputs. In its full generality, the spectral bound applies to the "highly resilient" functions introduced by Chor, Friedman, Goldreigh, Hastad, Rudich and Smolensky, and it yields non-linear lower bounds whenever the resiliency is asymptotic to the number of arguments.
Given a Boolean function f:{0,1}n→{0,1}f:\{0,1\}^n\to\{0,1\}f:{0,1}n→{0,1}, the goal in the usual query model is to compute fff on an unknown input x∈{0,1}nx \in \{0,1\}^nx∈{0,1}n while minimizing the number of queries to xxx. One can also consider a "distinguishing" problem denoted by fsabf_{\mathsf{sab}}fsab​: given an input x∈f−1(0)x \in f^{-1}(0)x∈f−1(0) and an input y∈f−1(1)y \in f^{-1}(1)y∈f−1(1), either all differing locations are replaced by a ∗*∗, or all differing locations are replaced by †\dagger†, and an algorithm's goal is to identify which of these is the case while minimizing the number of queries. Ben-David and Kothari [ToC'18] introduced the notion of randomized sabotage complexity of a Boolean function to be the zero-error randomized query complexity of fsabf_{\mathsf{sab}}fsab​. A natural follow-up question is to understand Q(fsab)\mathsf{Q}(f_{\mathsf{sab}})Q(fsab​), the quantum query complexity of fsabf_{\mathsf{sab}}fsab​. In this paper, we initiate a systematic study of this. The following are our main results: ∙    \bullet\;\;∙ If we have additional query access to xxx and yyy, then Q(fsab)=O(min⁡{Q(f),n})\mathsf{Q}(f_{\mathsf{sab}})=O(\min\{\mathsf{Q}(f),\sqrt{n}\})Q(fsab​)=O(min{Q(f),n​}). ∙    \bullet\;\;∙ If an algorithm is also required to output a differing index of a 0-input and a 1-input, then Q(fsab)=O(min⁡{Q(f)1.5,n})\mathsf{Q}(f_{\mathsf{sab}})=O(\min\{\mathsf{Q}(f)^{1.5},\sqrt{n}\})Q(fsab​)=O(min{Q(f)1.5,n​}). ∙    \bullet\;\;∙ Q(fsab)=Ω(fbs(f))\mathsf{Q}(f_{\mathsf{sab}}) = Ω(\sqrt{\mathsf{fbs}(f)})Q(fsab​)=Ω(fbs(f)​), where fbs(f)\mathsf{fbs}(f)fbs(f) denotes the fractional block sensitivity of fff. By known results, along with the results in the previous bullets, this implies that Q(fsab)\mathsf{Q}(f_{\mathsf{sab}})Q(fsab​) is polynomially related to Q(f)\mathsf{Q}(f)Q(f). ∙    \bullet\;\;∙ The bound above is easily seen to be tight for standard functions such as And, Or, Majority and Parity. We show that when fff is the Indexing function, Q(fsab)=Θ(fbs(f))\mathsf{Q}(f_{\mathsf{sab}})=Θ(\mathsf{fbs}(f))Q(fsab​)=Θ(fbs(f)), ruling out the possibility that Q(fsab)=Θ(fbs(f))\mathsf{Q}(f_{\mathsf{sab}})=Θ(\sqrt{\mathsf{fbs}(f)})Q(fsab​)=Θ(fbs(f)​) for all fff.
We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1/eps)) in both cases; and using extremal combinatorics, prove lower bounds of Omega(log n) in the randomized case and Omega(sqrt(log n)) in the quantum case for any eps>0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.
Let THk\mathsf{TH}_kTHk​ denote the kkk-out-of-nnn threshold function: given nnn input Boolean variables, the output is 111 if and only if at least kkk of the inputs are 111. We consider the problem of computing the THk\mathsf{TH}_kTHk​ function using noisy readings of the Boolean variables, where each reading is incorrect with some fixed and known probability p∈(0,1/2)p \in (0,1/2)p∈(0,1/2). As our main result, we show that it is sufficient to use (1+o(1))nlog⁡mδDKL(p∥1−p)(1+o(1)) \frac{n\log \frac{m}δ}{D_{\mathsf{KL}}(p \| 1-p)}(1+o(1))DKL​(p∥1−p)nlogδm​​ queries in expectation to compute the THk\mathsf{TH}_kTHk​ function with a vanishing error probability δ=o(1)δ= o(1)δ=o(1), where m≜min⁡{k,n−k+1}m\triangleq \min\{k,n-k+1\}m≜min{k,n−k+1} and DKL(p∥1−p)D_{\mathsf{KL}}(p \| 1-p)DKL​(p∥1−p) denotes the Kullback-Leibler divergence between Bern(p)\mathsf{Bern}(p)Bern(p) and Bern(1−p)\mathsf{Bern}(1-p)Bern(1−p) distributions. Conversely, we show that any algorithm achieving an error probability of δ=o(1)δ= o(1)δ=o(1) necessitates at least (1−o(1))(n−m)log⁡mδDKL(p∥1−p)(1-o(1))\frac{(n-m)\log\frac{m}δ}{D_{\mathsf{KL}}(p \| 1-p)}(1−o(1))DKL​(p∥1−p)(n−m)logδm​​ queries in expectation. The upper and lower bounds are tight when m=o(n)m=o(n)m=o(n), and are within a multiplicative factor of nn−m\frac{n}{n-m}n−mn​ when m=Θ(n)m=Θ(n)m=Θ(n). In particular, when k=n/2k=n/2k=n/2, the THk\mathsf{TH}_kTHk​ function corresponds to the MAJORITY\mathsf{MAJORITY}MAJORITY function, in which case the upper and lower bounds are tight up to a multiplicative factor of two. Compared to previous work, our result tightens the dependence on ppp in both the upper and lower bounds.