|
| related topics |
| {information, entropy, channel} |
| {let, theorem, proof} |
| {vol, operators, histories} |
| {error, code, errors} |
| {operator, operators, space} |
|
Strong Converse to the Quantum Channel Coding Theorem
Tomohiro Ogawa, Hiroshi Nagaoka
abstract: A lower bound on the probability of decoding error of quantum communication
channel is presented. The strong converse to the quantum channel coding theorem
is shown immediately from the lower bound. It is the same as Arimoto's method
exept for the difficulty due to non-commutativity.
- oai_identifier:
- oai:arXiv.org:quant-ph/9808063
- categories:
- quant-ph
- comments:
- LaTeX, 11 pages, submitted to IEEE Trans. Inform. Theory
- arxiv_id:
- quant-ph/9808063
- journal_ref:
- IEEE Trans.Info.Theor. 45 (1999) 2486-2489
- created:
- 1998-08-28
- updated:
- 1998-09-07
Full article ▸
|
|
| related documents |
| 0511171v1 |
| 0303117v1 |
| 0009048v2 |
| 0506197v3 |
| 9806065v1 |
| 0409026v1 |
| 0408004v2 |
| 0209030v1 |
| 0201061v1 |
| 9804036v1 |
| 0409187v1 |
| 0101117v1 |
| 0209159v1 |
| 0112034v1 |
| 0104057v1 |
| 0212025v1 |
| 0308044v2 |
| 0009075v1 |
| 0111115v1 |
| 0502093v1 |
| 9512022v3 |
| 0511217v1 |
| 0001023v6 |
| 0611070v1 |
| 0702059v3 |
|