dorsal/arxiv
View SchemaA New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory
| Authors | Tomohiro Ogawa, Hiroshi Nagaoka |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0208139 |
| URL | https://arxiv.org/abs/quant-ph/0208139 |
Abstract
A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of Hiai-Petz's theorem in quantum hypothesis testing.
{
"annotation_id": "d02048b0-0b28-4968-a69f-08cc4216bda4",
"date_created": "2026-03-02T18:01:52.570000Z",
"date_modified": "2026-03-02T18:01:52.570000Z",
"file_hash": "27e88721cbce84964500d690c28f764bf711e37b7900225fec3331badc9a6397",
"private": false,
"record": {
"abstract": "A new proof of the direct part of the quantum channel coding theorem is shown\nbased on a standpoint of quantum hypothesis testing. A packing procedure of\nmutually noncommutative operators is carried out to derive an upper bound on\nthe error probability, which is similar to Feinstein\u0027s lemma in classical\nchannel coding. The upper bound is used to show the proof of the direct part\nalong with a variant of Hiai-Petz\u0027s theorem in quantum hypothesis testing.",
"arxiv_id": "quant-ph/0208139",
"authors": [
"Tomohiro Ogawa",
"Hiroshi Nagaoka"
],
"categories": [
"quant-ph"
],
"title": "A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory",
"url": "https://arxiv.org/abs/quant-ph/0208139"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "746edf67-279a-469c-85d4-595b670c8f2a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}