On the communication complexity of XOR functions

Details On the communication complexity of XOR functions On the communication complexity of XOR functions

2009-09-18

arxiv.org/abs/0909.3392v2

Computer Science

Computational Complexity

18 pages; v2: minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the communication complexity of XOR functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the communication complexity of XOR functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the communication complexity of XOR functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276449