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:1704.00777

The Unbounded-Error Communication Complexity of symmetric XOR functions

Hamed Hatami, Yingjie Qian

Published Apr 3, 2017• 6 citations
arXivHTMLPDF

Abstract

Settling a conjecture of Shi and Zhang, we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov.
DOI
10.48550/arxiv.1704.00777

Related papers

Dual polynomials and communication complexity of $\textsf{XOR}$ functions

Arkadev Chattopadhyay, Nikhil S. Mande

We show a new duality between the polynomial margin complexity of $f$ and the discrepancy of the function $f \circ \textsf{XOR}$, called an $\textsf{XOR}$ function. Using this duality, we develop polynomial based techniques for understanding the bounded error ($\textsf{BPP}$) and the weakly-unbounded error ($\textsf{PP}$) communication complexities of $\textsf{XOR}$ functions. We show the following. A weak form of an interesting conjecture of Zhang and Shi (Quantum Information and Computation, 2009) (The full conjecture has just been reported to be independently settled by Hatami and Qian (Arxiv, 2017). However, their techniques are quite different and are not known to yield many of the results we obtain here). Zhang and Shi assert that for symmetric functions $f : \{0, 1\}^n \rightarrow \{-1, 1\}$, the weakly unbounded-error complexity of $f \circ \textsf{XOR}$ is essentially characterized by the number of points $i$ in the set $\{0,1, \dots,n-2\}$ for which $D_f(i) \neq D_f(i+2)$, where $D_f$ is the predicate corresponding to $f$. The number of such points is called the odd-even degree of $f$. We show that the $\textsf{PP}$ complexity of $f \circ \textsf{XOR}$ is $Ω(k/ \log(n/k))$. We resolve a conjecture of a different Zhang characterizing the Threshold of Parity circuit size of symmetric functions in terms of their odd-even degree. We obtain a new proof of the exponential separation between $\textsf{PP}^{cc}$ and $\textsf{UPP}^{cc}$ via an $\textsf{XOR}$ function. We provide a characterization of the approximate spectral norm of symmetric functions, affirming a conjecture of Ada et al. (APPROX-RANDOM, 2012) which has several consequences. Additionally, we prove strong $\textsf{UPP}$ lower bounds for $f \circ \textsf{XOR}$, when $f$ is symmetric and periodic with period $O(n^{1/2-ε})$, for any constant $ε> 0$.

arXiv:1704.02537•Apr 8, 2017•2 citations

Communication complexities of symmetric XOR functions

Zhiqiang Zhang, Y.-Y. Shi

We call $F:\{0, 1\}^n\times \{0, 1\}^n\to\{0, 1\}$ a symmetric XOR function if for a function $S:\{0, 1, ..., n\}\to\{0, 1\}$, $F(x, y)=S(|x\oplus y|)$, for any $x, y\in\{0, 1\}^n$, where $|x\oplus y|$ is the Hamming weight of the bit-wise XOR of $x$ and $y$. We show that for any such function, (a) the deterministic communication complexity is always $\Theta(n)$ except for four simple functions that have a constant complexity, and (b) up to a polylog factor, both the error-bounded randomized complexity and quantum communication with entanglement complexity are $\Theta(r_0+r_1)$, where $r_0$ and $r_1$ are the minimum integers such that $r_0, r_1\leq n/2$ and $S(k)=S(k+2)$ for all $k\in[r_0, n-r_1)$.

arXiv:0808.1762•Quantum Information and Computation•Mar 1, 2009•49 citations

On the Spectral Properties of Symmetric Functions

Anil Ada, Omar Fawzi, Raghav Kulkarni

We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm solves the main conjecture in [AFH12]. As an application of the characterization of the sign monomial complexity, we prove a conjecture in [ZS09] and provide a characterization for the unbounded-error communication complexity of symmetric-xor functions.

arXiv:1704.03176•Apr 11, 2017•4 citations

The Unbounded-Error Communication Complexity of Symmetric Functions

Alexander A. Sherstov

We prove an essentially tight lower bound on the unbounded-error communication complexity of every symmetric function, i.e., f(x,y)=D(|x∧y|), where D: {0,1,…,n}→{0,1} is a given predicate and x,y range over {0,1} n . Specifically, we show that the communication complexity of f is between Θ(k/log5 n) and Θ(k logn), where k is the number of value changes of D in {0,1,…, n}. Prior to this work, the problem was solved only for the parity predicate D (Forster 2001). Our proof is built around two new ideas. First, we show that a predicate D gives rise to a rapidly mixing random walk on ℤ 2 , which allows us to reduce the problem to communication lower bounds for “typical” predicates. Second, we use Paturi’s approximation lower bounds (1992), suitably generalized here to clusters of real nodes in [0,n] and interpreted in their dual form, to prove that a typical predicate behaves analogous to the parity predicate with respect to a smooth distribution on the inputs.

COMBINATORICA•Oct 1, 2008•38 citations

Quantum-Classical Equivalence for AND-Functions

Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay +2 more

A major open problem in quantum communication complexity is whether quantum protocols can be exponentially more efficient than classical protocols for computing total Boolean functions; the prevailing conjecture is that they cannot be so. In a seminal work, Razborov (2002) resolved this question for AND-functions of the form $$ F(x,y) = f(x_1 \land y_1, \ldots, x_n \land y_n), $$ when the outer function $f$ is symmetric, by proving that their bounded-error quantum and classical communication complexities are polynomially related. Since then, extending this result to all AND-functions has remained open and has been posed by several authors. In this work, we settle this problem in a strong way. We show that for every Boolean function $f$, the bounded-error quantum and classical deterministic communication complexities of the function $f \circ \mathrm{AND}_2$ are polynomially related, up to polylogarithmic factors in $n$. We prove this by showing that both are characterized--up to polynomial loss--by the logarithm of the De Morgan sparsity of $f$. Our results build on the recent work of Chattopadhyay, Dahiya, and Lovett (2025) on structural characterizations of non-sparse Boolean functions, which we extend to resolve the conjecture for general AND-functions.

cs.CCCross-listedarXiv:2606.03249•Leibniz international proceedings in informatics•Jun 3, 2026•0 citations

One-Way Communication Complexity of Partial XOR Functions

Vladimir V. Podolskii, Dmitrii Sluch

Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of $F$ is closely related to parity decision tree complexity of $f$. Montanaro and Osbourne (2009) observed that one-sided communication complexity $D_{cc}^{\rightarrow}(F)$ of $F$ is exactly equal to nonadaptive parity decision tree complexity $NADT^{\oplus}(f)$ of $f$. Hatami et al. (2018) showed that unrestricted communication complexity of $F$ is polynomially related to parity decision tree complexity of $f$. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of $f$. On the one hand, if $D_{cc}^{\rightarrow}(F)=t$ and $f$ is undefined on at most $O(\frac{2^{n-t}}{\sqrt{n-t}})$, then $NADT^{\oplus}(f)=t$. On the other hand, for a wide range of values of $D_{cc}^{\rightarrow}(F)$ and $NADT^{\oplus}(f)$ (from constant to $n-2$) we provide partial functions for which $D_{cc}^{\rightarrow}(F) < NADT^{\oplus}(f)$. In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.

arXiv:2310.20606•Leibniz international proceedings in informatics•Oct 31, 2023•1 citation
Dual polynomials and communication complexity of XOR\textsf{XOR}XOR functions
We show a new duality between the polynomial margin complexity of fff and the discrepancy of the function f∘XORf \circ \textsf{XOR}f∘XOR, called an XOR\textsf{XOR}XOR function. Using this duality, we develop polynomial based techniques for understanding the bounded error (BPP\textsf{BPP}BPP) and the weakly-unbounded error (PP\textsf{PP}PP) communication complexities of XOR\textsf{XOR}XOR functions. We show the following. A weak form of an interesting conjecture of Zhang and Shi (Quantum Information and Computation, 2009) (The full conjecture has just been reported to be independently settled by Hatami and Qian (Arxiv, 2017). However, their techniques are quite different and are not known to yield many of the results we obtain here). Zhang and Shi assert that for symmetric functions f:{0,1}n→{−1,1}f : \{0, 1\}^n \rightarrow \{-1, 1\}f:{0,1}n→{−1,1}, the weakly unbounded-error complexity of f∘XORf \circ \textsf{XOR}f∘XOR is essentially characterized by the number of points iii in the set {0,1,…,n−2}\{0,1, \dots,n-2\}{0,1,…,n−2} for which Df(i)≠Df(i+2)D_f(i) \neq D_f(i+2)Df​(i)=Df​(i+2), where DfD_fDf​ is the predicate corresponding to fff. The number of such points is called the odd-even degree of fff. We show that the PP\textsf{PP}PP complexity of f∘XORf \circ \textsf{XOR}f∘XOR is Ω(k/log⁡(n/k))Ω(k/ \log(n/k))Ω(k/log(n/k)). We resolve a conjecture of a different Zhang characterizing the Threshold of Parity circuit size of symmetric functions in terms of their odd-even degree. We obtain a new proof of the exponential separation between PPcc\textsf{PP}^{cc}PPcc and UPPcc\textsf{UPP}^{cc}UPPcc via an XOR\textsf{XOR}XOR function. We provide a characterization of the approximate spectral norm of symmetric functions, affirming a conjecture of Ada et al. (APPROX-RANDOM, 2012) which has several consequences. Additionally, we prove strong UPP\textsf{UPP}UPP lower bounds for f∘XORf \circ \textsf{XOR}f∘XOR, when fff is symmetric and periodic with period O(n1/2−ε)O(n^{1/2-ε})O(n1/2−ε), for any constant ε>0ε> 0ε>0.
We call F:{0,1}n×{0,1}n→{0,1}F:\{0, 1\}^n\times \{0, 1\}^n\to\{0, 1\}F:{0,1}n×{0,1}n→{0,1} a symmetric XOR function if for a function S:{0,1,...,n}→{0,1}S:\{0, 1, ..., n\}\to\{0, 1\}S:{0,1,...,n}→{0,1}, F(x,y)=S(∣x⊕y∣)F(x, y)=S(|x\oplus y|)F(x,y)=S(∣x⊕y∣), for any x,y∈{0,1}nx, y\in\{0, 1\}^nx,y∈{0,1}n, where ∣x⊕y∣|x\oplus y|∣x⊕y∣ is the Hamming weight of the bit-wise XOR of xxx and yyy. We show that for any such function, (a) the deterministic communication complexity is always Θ(n)\Theta(n)Θ(n) except for four simple functions that have a constant complexity, and (b) up to a polylog factor, both the error-bounded randomized complexity and quantum communication with entanglement complexity are Θ(r0+r1)\Theta(r_0+r_1)Θ(r0​+r1​), where r0r_0r0​ and r1r_1r1​ are the minimum integers such that r0,r1≤n/2r_0, r_1\leq n/2r0​,r1​≤n/2 and S(k)=S(k+2)S(k)=S(k+2)S(k)=S(k+2) for all k∈[r0,n−r1)k\in[r_0, n-r_1)k∈[r0​,n−r1​).
We prove an essentially tight lower bound on the unbounded-error communication complexity of every symmetric function, i.e., f(x,y)=D(|x∧y|), where D: {0,1,…,n}→{0,1} is a given predicate and x,y range over {0,1} n . Specifically, we show that the communication complexity of f is between Θ(k/log5 n) and Θ(k logn), where k is the number of value changes of D in {0,1,…, n}. Prior to this work, the problem was solved only for the parity predicate D (Forster 2001). Our proof is built around two new ideas. First, we show that a predicate D gives rise to a rapidly mixing random walk on ℤ 2 , which allows us to reduce the problem to communication lower bounds for “typical” predicates. Second, we use Paturi’s approximation lower bounds (1992), suitably generalized here to clusters of real nodes in [0,n] and interpreted in their dual form, to prove that a typical predicate behaves analogous to the parity predicate with respect to a smooth distribution on the inputs.
A major open problem in quantum communication complexity is whether quantum protocols can be exponentially more efficient than classical protocols for computing total Boolean functions; the prevailing conjecture is that they cannot be so. In a seminal work, Razborov (2002) resolved this question for AND-functions of the form F(x,y)=f(x1∧y1,…,xn∧yn), F(x,y) = f(x_1 \land y_1, \ldots, x_n \land y_n), F(x,y)=f(x1​∧y1​,…,xn​∧yn​), when the outer function fff is symmetric, by proving that their bounded-error quantum and classical communication complexities are polynomially related. Since then, extending this result to all AND-functions has remained open and has been posed by several authors. In this work, we settle this problem in a strong way. We show that for every Boolean function fff, the bounded-error quantum and classical deterministic communication complexities of the function f∘AND2f \circ \mathrm{AND}_2f∘AND2​ are polynomially related, up to polylogarithmic factors in nnn. We prove this by showing that both are characterized--up to polynomial loss--by the logarithm of the De Morgan sparsity of fff. Our results build on the recent work of Chattopadhyay, Dahiya, and Lovett (2025) on structural characterizations of non-sparse Boolean functions, which we extend to resolve the conjecture for general AND-functions.
Boolean function F(x,y)F(x,y)F(x,y) for x,y∈{0,1}nx,y \in \{0,1\}^nx,y∈{0,1}n is an XOR function if F(x,y)=f(x⊕y)F(x,y)=f(x\oplus y)F(x,y)=f(x⊕y) for some function fff on nnn input bits, where ⊕\oplus⊕ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known that deterministic communication complexity of FFF is closely related to parity decision tree complexity of fff. Montanaro and Osbourne (2009) observed that one-sided communication complexity Dcc→(F)D_{cc}^{\rightarrow}(F)Dcc→​(F) of FFF is exactly equal to nonadaptive parity decision tree complexity NADT⊕(f)NADT^{\oplus}(f)NADT⊕(f) of fff. Hatami et al. (2018) showed that unrestricted communication complexity of FFF is polynomially related to parity decision tree complexity of fff. We initiate the studies of a similar connection for partial functions. We show that in case of one-sided communication complexity whether these measures are equal, depends on the number of undefined inputs of fff. On the one hand, if Dcc→(F)=tD_{cc}^{\rightarrow}(F)=tDcc→​(F)=t and fff is undefined on at most O(2n−tn−t)O(\frac{2^{n-t}}{\sqrt{n-t}})O(n−t​2n−t​), then NADT⊕(f)=tNADT^{\oplus}(f)=tNADT⊕(f)=t. On the other hand, for a wide range of values of Dcc→(F)D_{cc}^{\rightarrow}(F)Dcc→​(F) and NADT⊕(f)NADT^{\oplus}(f)NADT⊕(f) (from constant to n−2n-2n−2) we provide partial functions for which Dcc→(F)<NADT⊕(f)D_{cc}^{\rightarrow}(F) < NADT^{\oplus}(f)Dcc→​(F)<NADT⊕(f). In particular, we provide a function with an exponential gap between the two measures. Our separation results translate to the case of two-sided communication complexity as well, in particular showing that the result of Hatami et al. (2018) cannot be generalized to partial functions. Previous results for total functions heavily rely on Boolean Fourier analysis and the technique does not translate to partial functions. For the proofs of our results we build a linear algebraic framework instead. Separation results are proved through the reduction to covering codes.