dorsal/arxiv
View SchemaNot So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States
| Authors | Shay Mozes, Benni Reznik, Jonathan Oppenheim |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0403189 |
| URL | https://arxiv.org/abs/quant-ph/0403189 |
| DOI | 10.1103/PhysRevA.71.012311 |
| Journal | Phys. Rev. A 71, 012311 (2005) |
Abstract
The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of non-maximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the information capacity of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle, is between $d$ and 2d. In general we show that the alphabet size grows in "steps" with the possible values $ d, d+1, ..., d^2-2 $. We also find that states with less entanglement can have greater communication capacity than other more entangled states.
{
"annotation_id": "345a27d6-106e-4b16-a491-ff20b4de6230",
"date_created": "2026-03-02T18:02:06.985000Z",
"date_modified": "2026-03-02T18:02:06.985000Z",
"file_hash": "974166752f9e3314dc7b0c463ed66451dd813b411da388689f047b03218a9f60",
"private": false,
"record": {
"abstract": "The utilization of a $d$-level partially entangled state, shared by two\nparties wishing to communicate classical information without errors over a\nnoiseless quantum channel, is discussed. We analytically construct\ndeterministic dense coding schemes for certain classes of non-maximally\nentangled states, and numerically obtain schemes in the general case. We study\nthe dependency of the information capacity of such schemes on the partially\nentangled state shared by the two parties. Surprisingly, for $d\u003e2$ it is\npossible to have deterministic dense coding with less than one ebit. In this\ncase the number of alphabet letters that can be communicated by a single\nparticle, is between $d$ and 2d. In general we show that the alphabet size\ngrows in \"steps\" with the possible values $ d, d+1, ..., d^2-2 $. We also find\nthat states with less entanglement can have greater communication capacity than\nother more entangled states.",
"arxiv_id": "quant-ph/0403189",
"authors": [
"Shay Mozes",
"Benni Reznik",
"Jonathan Oppenheim"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.71.012311",
"journal_ref": "Phys. Rev. A 71, 012311 (2005)",
"title": "Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States",
"url": "https://arxiv.org/abs/quant-ph/0403189"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8d15a5a9-7924-44f4-85bb-d5cf0bba7f0b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}