A random-coding based proof for the quantum coding theorem
| dc.creator | Klesse, Rochus | |
| dc.date | 2007-12-16 | |
| dc.date.accessioned | 2026-07-07T08:49:33Z | |
| dc.date.available | 2026-07-07T08:49:33Z | |
| dc.description | We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original treatment of information transmission via a noisy classical channel. | |
| dc.description | 25 pages, to appear in Open Systems and Information Dynamics | |
| dc.identifier | https://arxiv.org/abs/0712.2558 | |
| dc.identifier | http://arxiv.org/abs/0712.2558 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/144340 | |
| dc.subject | Quantum Physics | |
| dc.title | A random-coding based proof for the quantum coding theorem | |
| dc.type | text |