On rounds in quantum communication

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, LaTeX. Partially rewritten and bugs removed. Appears joined with quant-ph/0005106 at 33rd STOC

Scientific paper

We investigate the power of interaction in two player quantum communication protocols. Our main result is a rounds-communication hierarchy for the pointer jumping function $f_k$. We show that $f_k$ needs quantum communication $\Omega(n)$ if Bob starts the communication and the number of rounds is limited to $k$ (for any constant $k$). Trivially, if Alice starts, $O(k\log n)$ communication in $k$ rounds suffices. The lower bound employs a result relating the relative von Neumann entropy between density matrices to their trace distance and uses a new measure of information. We also describe a classical probabilistic $k$ round protocol with communication $O(n/k\cdot(\log^{(k/2)}n+\log k)+k\log n)$ in which Bob starts the communication. Furthermore as a consequence of the lower bound for pointer jumping we show that any $k$ round quantum protocol for the disjointness problem needs communication $\Omega(n^{1/k})$ for $k=O(1)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On rounds in quantum communication 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 rounds in quantum communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On rounds in quantum communication will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-43298

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.