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:0808.1762 · Quantum Information and Computation

Communication complexities of symmetric XOR functions

Zhiqiang Zhang, Y.-Y. Shi

Published Mar 1, 2009• 49 citations
arXivHTMLPDF

Abstract

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)$.

DOI
10.26421/qic9.3-4-5

Related papers

The Unbounded-Error Communication Complexity of symmetric XOR functions

Hamed Hatami, Yingjie Qian

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.

arXiv:1704.00777•Apr 3, 2017•6 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

On the communication complexity of XOR functions

Ashley Montanaro, Tobias Osborne

An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f. We also show that, when f is monotone, g's quantum and classical complexities are quadratically related, and that when f is a linear threshold function, g's quantum complexity is Theta(n). More generally, we make a structural conjecture about the Fourier spectra of boolean functions which, if true, would imply that the quantum and classical exact communication complexities of all XOR functions are asymptotically equivalent. We give two randomised classical protocols for general XOR functions which are efficient for certain functions, and a third protocol for linear threshold functions with high margin. These protocols operate in the symmetric message passing model with shared randomness.

arXiv:0909.3392•Sep 18, 2009•63 citations

Matching upper bounds on symmetric predicates in quantum communication complexity

Daiki Suruga

In this paper, we focus on the quantum communication complexity of functions of the form $f \circ G = f(G(X_1, Y_1), \ldots, G(X_n, Y_n))$ where $f: \Bset^n \to \Bset$ is a symmetric function, $G: \Bset^j \times \Bset^k \to \Bset$ is any function and Alice (resp. Bob) is given $(X_i)_{i \in [n]}$ (resp. $(Y_i)_{i \in [n]}$). Recently, Chakraborty et al. [STACS 2022] showed that the quantum communication complexity of $f \circ G$ is $O(Q(f)\QCCEX(G))$ when the parties are allowed to use shared entanglement, where $Q(f)$ is the query complexity of $f$ and $\QCCEX(G)$ is the exact communication complexity of $G$. }{In this paper, we first show that the same statement holds \emph{without both shared entanglement and shared randomness}, which generalizes their result. Based on the improved result, we next show tight upper bounds on $f \circ \mathrm{AND}_2$ for any symmetric function $f$ (where $\textrm{AND}_2 : \Bset \times \Bset \to \Bset$ denotes the 2-bit AND function) in both models: with shared entanglement and without shared entanglement. This matches the well-known lower bound by Razborov~[Izv. Math. 67(1) 145, 2003] when shared entanglement is allowed and improves Razborov's bound when shared entanglement is not allowed.

arXiv:2301.00370•Quantum Information and Computation•Oct 1, 2024•3 citations

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

Multiplayer XOR games and quantum communication complexity with clique-wise entanglement

Jop Briët, Harry Buhrman, Troy Lee +1 more

XOR games are a simple computational model with connections to many areas of complexity theory. Perhaps the earliest use of XOR games was in the study of quantum correlations. XOR games also have an interesting connection to Grothendieck's inequality, a fundamental theorem of analysis, which shows that two players sharing entanglement can achieve at most a constant factor advantage over players following classical strategies in an XOR game. Perez-Garcia et al. show that when the players share GHZ states, this advantage is bounded by a constant. We use a multilinear generalization of Grothendieck's inequality due to Blei and Tonge to simplify the proof of the second result and extend it to the case of so-called Schmidt states, answering an open problem of Perez-Garcia et al. Via a reduction given in that paper, this answers a 35-year-old problem in operator algebras due to Varopoulos, showing that the space of compact operators on a Hilbert space is a Q-algebra under Schur product. A further generalization of Grothendieck's inequality due to Carne lets us show that the gap between the entangled and classical value is at most a constant in any multiplayer XOR game in which the players are allowed to share combinations of GHZ states and EPR pairs of any dimension. As an application of our results, we show that the discrepancy method in communication complexity remains a lower bound in the multiparty model where the players have quantum communication and the kinds of entanglement discussed above. This answers an open question of Lee, Schechtman, and Shraibman.

arXiv:0911.4007•Nov 20, 2009•25 citations
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​).
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.
An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f. We also show that, when f is monotone, g's quantum and classical complexities are quadratically related, and that when f is a linear threshold function, g's quantum complexity is Theta(n). More generally, we make a structural conjecture about the Fourier spectra of boolean functions which, if true, would imply that the quantum and classical exact communication complexities of all XOR functions are asymptotically equivalent. We give two randomised classical protocols for general XOR functions which are efficient for certain functions, and a third protocol for linear threshold functions with high margin. These protocols operate in the symmetric message passing model with shared randomness.
In this paper, we focus on the quantum communication complexity of functions of the form f∘G=f(G(X1,Y1),…,G(Xn,Yn))f \circ G = f(G(X_1, Y_1), \ldots, G(X_n, Y_n))f∘G=f(G(X1​,Y1​),…,G(Xn​,Yn​)) where $f: \Bset^n \to \Bset$ is a symmetric function, $G: \Bset^j \times \Bset^k \to \Bset$ is any function and Alice (resp. Bob) is given (Xi)i∈[n](X_i)_{i \in [n]}(Xi​)i∈[n]​ (resp. (Yi)i∈[n](Y_i)_{i \in [n]}(Yi​)i∈[n]​). Recently, Chakraborty et al. [STACS 2022] showed that the quantum communication complexity of f∘Gf \circ Gf∘G is $O(Q(f)\QCCEX(G))$ when the parties are allowed to use shared entanglement, where Q(f)Q(f)Q(f) is the query complexity of fff and $\QCCEX(G)$ is the exact communication complexity of GGG. }{In this paper, we first show that the same statement holds \emph{without both shared entanglement and shared randomness}, which generalizes their result. Based on the improved result, we next show tight upper bounds on f∘AND2f \circ \mathrm{AND}_2f∘AND2​ for any symmetric function fff (where $\textrm{AND}_2 : \Bset \times \Bset \to \Bset$ denotes the 2-bit AND function) in both models: with shared entanglement and without shared entanglement. This matches the well-known lower bound by Razborov~[Izv. Math. 67(1) 145, 2003] when shared entanglement is allowed and improves Razborov's bound when shared entanglement is not allowed.
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.
XOR games are a simple computational model with connections to many areas of complexity theory. Perhaps the earliest use of XOR games was in the study of quantum correlations. XOR games also have an interesting connection to Grothendieck's inequality, a fundamental theorem of analysis, which shows that two players sharing entanglement can achieve at most a constant factor advantage over players following classical strategies in an XOR game. Perez-Garcia et al. show that when the players share GHZ states, this advantage is bounded by a constant. We use a multilinear generalization of Grothendieck's inequality due to Blei and Tonge to simplify the proof of the second result and extend it to the case of so-called Schmidt states, answering an open problem of Perez-Garcia et al. Via a reduction given in that paper, this answers a 35-year-old problem in operator algebras due to Varopoulos, showing that the space of compact operators on a Hilbert space is a Q-algebra under Schur product. A further generalization of Grothendieck's inequality due to Carne lets us show that the gap between the entangled and classical value is at most a constant in any multiplayer XOR game in which the players are allowed to share combinations of GHZ states and EPR pairs of any dimension. As an application of our results, we show that the discrepancy method in communication complexity remains a lower bound in the multiparty model where the players have quantum communication and the kinds of entanglement discussed above. This answers an open question of Lee, Schechtman, and Shraibman.