dorsal/arxiv
View SchemaOptimal superdense coding of entangled states
| Authors | Anura Abeyesinghe, Patrick Hayden, Graeme Smith, Andreas Winter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0407061 |
| URL | https://arxiv.org/abs/quant-ph/0407061 |
| DOI | 10.1109/TIT.2006.878174 |
| Journal | IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3635-3641, 2006 |
Abstract
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a 2n-qubit quantum state could be communicated to a receiver by physically transmitting only n+o(n) qubits in addition to consuming n ebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.
{
"annotation_id": "a7ea4b9b-4d32-4064-828f-5385e00481f9",
"date_created": "2026-03-02T18:02:10.175000Z",
"date_modified": "2026-03-02T18:02:10.175000Z",
"file_hash": "33da4cd1e3902193c61a002af389110d234d282022f1108198958b0e41600f05",
"private": false,
"record": {
"abstract": "We present a one-shot method for preparing pure entangled states between a\nsender and a receiver at a minimal cost of entanglement and quantum\ncommunication. In the case of preparing unentangled states, an earlier paper\nshowed that a 2n-qubit quantum state could be communicated to a receiver by\nphysically transmitting only n+o(n) qubits in addition to consuming n ebits of\nentanglement and some shared randomness. When the states to be prepared are\nentangled, we find that there is a reduction in the number of qubits that need\nto be transmitted, interpolating between no communication at all for maximally\nentangled states and the earlier two-for-one result of the unentangled case,\nall without the use of any shared randomness. We also present two applications\nof our result: a direct proof of the achievability of the optimal superdense\ncoding protocol for entangled states produced by a memoryless source, and a\ndemonstration that the quantum identification capacity of an ebit is two\nqubits.",
"arxiv_id": "quant-ph/0407061",
"authors": [
"Anura Abeyesinghe",
"Patrick Hayden",
"Graeme Smith",
"Andreas Winter"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TIT.2006.878174",
"journal_ref": "IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3635-3641, 2006",
"title": "Optimal superdense coding of entangled states",
"url": "https://arxiv.org/abs/quant-ph/0407061"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "15dec791-7371-410e-b4fa-3ff71f0cc96b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}