Physics – Quantum Physics
Scientific paper
2001-06-28
Physics
Quantum Physics
26pages, appeared in the Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science
Scientific paper
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity and nondeterministic quantum communication complexity. We develop several other lower bound methods based on the Fourier transform, notably showing that \sqrt{\bar{s}(f)/\log n}, for the average sensitivity \bar{s}(f) of a function f, yields a lower bound on the bounded error quantum communication complexity of f(x AND y XOR z), where x is a Boolean word held by Alice and y,z are Boolean words held by Bob. We then prove the first large lower bounds on the bounded error quantum communication complexity of functions, for which a polynomial quantum speedup is possible. For all the functions we investigate, the only previously applied general lower bound method based on discrepancy yields bounds that are O(\log n).
No associations
LandOfFree
Lower bounds for quantum communication complexity 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 Lower bounds for quantum communication complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for quantum communication complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124850