dorsal/arxiv
View SchemaStrong Converse to the Quantum Channel Coding Theorem
| Authors | Tomohiro Ogawa, Hiroshi Nagaoka |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9808063 |
| URL | https://arxiv.org/abs/quant-ph/9808063 |
| DOI | 10.1109/18.796386 |
| Journal | IEEE Trans.Info.Theor. 45 (1999) 2486-2489 |
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.
{
"annotation_id": "63195ad6-accc-4aaf-af50-acef9bc5d045",
"date_created": "2026-03-02T18:02:45.256000Z",
"date_modified": "2026-03-02T18:02:45.256000Z",
"file_hash": "5141c8eb77a42d9f92a068fe1b1ab1acf9af916eae01e2f42b464a6f0bc437b0",
"private": false,
"record": {
"abstract": "A lower bound on the probability of decoding error of quantum communication\nchannel is presented. The strong converse to the quantum channel coding theorem\nis shown immediately from the lower bound. It is the same as Arimoto\u0027s method\nexept for the difficulty due to non-commutativity.",
"arxiv_id": "quant-ph/9808063",
"authors": [
"Tomohiro Ogawa",
"Hiroshi Nagaoka"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/18.796386",
"journal_ref": "IEEE Trans.Info.Theor. 45 (1999) 2486-2489",
"title": "Strong Converse to the Quantum Channel Coding Theorem",
"url": "https://arxiv.org/abs/quant-ph/9808063"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3c08c9f7-1db0-42ca-959a-646adc6b8784",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}