Improved Quantum Communication Complexity Bounds for Disjointness and Equality

Details Improved Quantum Communication Complexity Bounds for Disjointness and Equality Improved Quantum Communication Complexity Bounds for Disjointness and Equality

2001-09-14

arxiv.org/abs/quant-ph/0109068v1

Physics

Quantum Physics

11 pages LaTeX

Scientific paper

We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^* n})-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an Omega(sqrt{n}) lower bound for a large class of protocols that includes the BCW-protocol as well as our new protocol.

Affiliated with

Also associated with

No associations

Rating

Improved Quantum Communication Complexity Bounds for Disjointness and Equality 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 Improved Quantum Communication Complexity Bounds for Disjointness and Equality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Quantum Communication Complexity Bounds for Disjointness and Equality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258711