dorsal/arxiv
View SchemaProbabilistic Super Dense Coding
| Authors | A. K. Pati, P. Parashar, P. Agrawal |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0412039 |
| URL | https://arxiv.org/abs/quant-ph/0412039 |
| DOI | 10.1103/PhysRevA.72.012329 |
| Journal | Phys. Rev. A 72, 012329 (2005) |
Abstract
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.
{
"annotation_id": "cabfb60a-54c2-40a5-a5d6-5f0514220d72",
"date_created": "2026-03-02T18:02:13.322000Z",
"date_modified": "2026-03-02T18:02:13.322000Z",
"file_hash": "3451d8ae592bf2b1254c2e46796fc33cbf54ff8adba748bdc20d8952c0003c19",
"private": false,
"record": {
"abstract": "We explore the possibility of performing super dense coding with\nnon-maximally entangled states as a resource. Using this we find that one can\nsend two classical bits in a probabilistic manner by sending a qubit. We\ngeneralize our scheme to higher dimensions and show that one can communicate\n2log_2 d classical bits by sending a d-dimensional quantum state with a certain\nprobability of success. The success probability in super dense coding is\nrelated to the success probability of distinguishing non-orthogonal states. The\noptimal average success probabilities are explicitly calculated. We consider\nthe possibility of sending 2 log_2 d classical bits with a shared resource of a\nhigher dimensional entangled state (D X D, D \u003e d). It is found that more\nentanglement does not necessarily lead to higher success probability. This also\nanswers the question as to why we need log_2 d ebits to send 2 log_2 d\nclassical bits in a deterministic fashion.",
"arxiv_id": "quant-ph/0412039",
"authors": [
"A. K. Pati",
"P. Parashar",
"P. Agrawal"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.72.012329",
"journal_ref": "Phys. Rev. A 72, 012329 (2005)",
"title": "Probabilistic Super Dense Coding",
"url": "https://arxiv.org/abs/quant-ph/0412039"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "06ecd89a-1628-49a1-81b3-e5019cea84b7",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}