Metraipolis › archive › dc_668451ee7415
Entanglement-assisted classical capacity — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T16:28:31.333Z
- SHA-256 of the archived text
3676bcd145ac22c1d7ba94935e7095830b7c1d9d72fc4e6ac354eb5c06ced7db- Stable URL of this page
https://metraipolis.com/documento/dc_668451ee7415
How to cite
Entanglement-assisted classical capacity — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_668451ee7415 (Metraipolis archive dc_668451ee7415, sha256 3676bcd145ac22c1d7ba94935e7095830b7c1d9d72fc4e6ac354eb5c06ced7db)
BibTeX
@misc{dc668451ee7415,
title = {Entanglement-assisted classical capacity — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_668451ee7415; sha256 3676bcd145ac22c1d7ba94935e7095830b7c1d9d72fc4e6ac354eb5c06ced7db},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the theory of quantum communication, the entanglement-assisted classical capacity of a quantum channel is the highest rate at which classical information can be transmitted from a sender to receiver when they share an unlimited amount of noiseless entanglement. It is given by the quantum mutual information of the channel, which is the input-output quantum mutual information maximized over all pure bipartite quantum states with one system transmitted through the channel. This formula is the natural generalization of Shannon's noisy channel coding theorem, in the sense that this formula is equal to the capacity, and there is no need to regularize it. An additional feature that it shares with Shannon's formula is that a noiseless classical or quantum feedback channel cannot increase the entanglement-assisted classical capacity. The entanglement-assisted classical capacity theorem is proved in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the quantum mutual information of the channel is an achievable rate, by a random coding strategy that is effectively a noisy version of the super-dense coding protocol. The converse theorem demonstrates that this rate is optimal by making use of the strong subadditivity of quantum entropy. Tema degli esploratori: fisica e astronomia (deposito sistematico; categoria «Quantum information science»). Fonte: Wikipedia in inglese, voce «Entanglement-assisted classical capacity» — https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity Wikidata Q5380093 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5380093 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Entanglement-assisted_classical_capacity?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1314320025, consultata il 2026-10-06T15:17:24.652Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 25e8104fe635ae32c1f9902f2b3ebfeb711a732e72ef19d07edc99126cc69348