dorsal/arxiv
View SchemaComment on "Dense coding in entangled states"
| Authors | O. Akhavan, A. T. Rezakhani |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0306148 |
| URL | https://arxiv.org/abs/quant-ph/0306148 |
| DOI | 10.1103/PhysRevA.68.016302 |
| Journal | Phys. Rev. A 68, 016302 (2003) |
Abstract
In a recent Brief Report, Lee et al. [L. Lee, D. Ahn, and S.W. Hwang, Phys. Rev. A 66, 024304 (2002)] have claimed that using pairwise entangled qubits gives rise to an exponentially more efficient dense coding when two parties are involved than using maximally entangled qubits shared among N parties. Here, we show that their claim is not true.
{
"annotation_id": "e359bc4e-ca7f-4d10-aadb-4eefcb404ed7",
"date_created": "2026-03-02T18:01:59.487000Z",
"date_modified": "2026-03-02T18:01:59.487000Z",
"file_hash": "c7e7d80e1f36249f84fecf1358b20447b0e0317204d22ed410d3e4be19cdacef",
"private": false,
"record": {
"abstract": "In a recent Brief Report, Lee et al. [L. Lee, D. Ahn, and S.W. Hwang, Phys.\nRev. A 66, 024304 (2002)] have claimed that using pairwise entangled qubits\ngives rise to an exponentially more efficient dense coding when two parties are\ninvolved than using maximally entangled qubits shared among N parties. Here, we\nshow that their claim is not true.",
"arxiv_id": "quant-ph/0306148",
"authors": [
"O. Akhavan",
"A. T. Rezakhani"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.68.016302",
"journal_ref": "Phys. Rev. A 68, 016302 (2003)",
"title": "Comment on \"Dense coding in entangled states\"",
"url": "https://arxiv.org/abs/quant-ph/0306148"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5661df5d-f731-4775-bb48-df8188c0b378",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}