Probabilistic Super Dense Coding

Details Probabilistic Super Dense Coding Probabilistic Super Dense Coding

2004-12-06

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

Phys. Rev. A 72, 012329 (2005)

Physics

Quantum Physics

Latex file, no figures, 11 pages, Discussion changed in Section 4

Scientific paper

10.1103/PhysRevA.72.012329

We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log_2 d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in super dense coding is related to the success probability of distinguishing non-orthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending 2 log_2 d classical bits with a shared resource of a higher dimensional entangled state (D X D, D > d). It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need log_2 d ebits to send 2 log_2 d classical bits in a deterministic fashion.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Super Dense Coding 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 Probabilistic Super Dense Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Super Dense Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41360