Probabilistic superdense coding

Journal Article · Fri Jul 15 04:00:00 EDT 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.72.012329· OSTI ID:20718337

Pati, A K; Agrawal, P ^[1]; Parashar, P ^[2]

---

1. Institute of Physics, Sainik School Post, Bhubaneswar-751005 (India)
2. Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata-700108 (India)

We explore the possibility of performing superdense coding with nonmaximally 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 2 log{sub 2}d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending 2 log{sub 2}d classical bits with a shared resource of a higher dimensional entangled state (DxD,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{sub 2}d ebits to send 2 log{sub 2}d classical bits in a deterministic fashion.

• OSTI ID: 20718337
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 1 Vol. 72; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
CORRELATIONS
DATA TRANSMISSION
PROBABILISTIC ESTIMATION
PROBABILITY
QUANTUM ENTANGLEMENT
QUANTUM MECHANICS
QUBITS
SECRECY PROTECTION