On communication over an entanglement-assisted quantum channel

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Appeared in the joint session of 34th ACM STOC, 2002, and 17th IEEE Complexity, 2002

Scientific paper

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

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

Rate now

     

Profile ID: LFWR-SCP-O-458884

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