dorsal/arxiv
View SchemaA low-rate bound on the reliability of a quantum discrete memoryless channel
| Authors | Alexander Barg |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0203077 |
| URL | https://arxiv.org/abs/quant-ph/0203077 |
Abstract
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical channel.
{
"annotation_id": "226de703-deab-4910-adfb-64585698d42f",
"date_created": "2026-03-02T18:01:49.147000Z",
"date_modified": "2026-03-02T18:01:49.147000Z",
"file_hash": "3b13132ea15865d913082b49b9667fc8ea530d7f02602427a7390c344b59a23e",
"private": false,
"record": {
"abstract": "We extend a low-rate improvement of the random coding bound on the\nreliability of a classical discrete memoryless channel to its quantum\ncounterpart. The key observation that we make is that the problem of bounding\nbelow the error exponent for a quantum channel relying on the class of\nstabilizer codes is equivalent to the problem of deriving error exponents for a\ncertain symmetric classical channel.",
"arxiv_id": "quant-ph/0203077",
"authors": [
"Alexander Barg"
],
"categories": [
"quant-ph"
],
"title": "A low-rate bound on the reliability of a quantum discrete memoryless channel",
"url": "https://arxiv.org/abs/quant-ph/0203077"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0337e828-2b32-4f77-9812-b777f68bb05e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}