A lower bound on entanglement-assisted quantum communication complexity

Details A lower bound on entanglement-assisted quantum communication complexity A lower bound on entanglement-assisted quantum communication complexity

2006-10-11

arxiv.org/abs/quant-ph/0610085v2

In Proc. ICALP'07, 2007

Physics

Quantum Physics

10 pages; v2 adds references and fixes typos

Scientific paper

We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boolean functions on n+n bits have linear communication complexity, even in the presence of unlimited entanglement.

Affiliated with

Also associated with

No associations

Rating

A lower bound on entanglement-assisted 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 A lower bound on entanglement-assisted quantum communication complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound on entanglement-assisted quantum communication complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579563