dorsal/arxiv
View SchemaInformation Rates Achievable with Algebraic Codes on Quantum Discrete Memoryless Channels
| Authors | Mitsuru Hamada |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0207113 |
| URL | https://arxiv.org/abs/quant-ph/0207113 |
| Journal | IEEE Trans. Information Theory, vol. 51, no. 12, pp. 4263--4277, 2005 |
Abstract
The highest information rate at which quantum error-correction schemes work reliably on a channel, which is called the quantum capacity, is proven to be lower bounded by the limit of the quantity termed coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension, and the codes that are proven to have the desired performance are symplectic stabilizer codes. On the depolarizing channel, this work's bound is actually the highest possible rate at which symplectic stabilizer codes work reliably.
{
"annotation_id": "25f9bf19-bc6e-4c55-8710-c0f87efdb900",
"date_created": "2026-03-02T18:01:52.557000Z",
"date_modified": "2026-03-02T18:01:52.557000Z",
"file_hash": "663d3520613842ead0eddfa5a6f3d87fd1015701063fd8850d8437bbeac6e05f",
"private": false,
"record": {
"abstract": "The highest information rate at which quantum error-correction schemes work\nreliably on a channel, which is called the quantum capacity, is proven to be\nlower bounded by the limit of the quantity termed coherent information\nmaximized over the set of input density operators which are proportional to the\nprojections onto the code spaces of symplectic stabilizer codes. Quantum\nchannels to be considered are those subject to independent errors and modeled\nas tensor products of copies of a completely positive linear map on a Hilbert\nspace of finite dimension, and the codes that are proven to have the desired\nperformance are symplectic stabilizer codes. On the depolarizing channel, this\nwork\u0027s bound is actually the highest possible rate at which symplectic\nstabilizer codes work reliably.",
"arxiv_id": "quant-ph/0207113",
"authors": [
"Mitsuru Hamada"
],
"categories": [
"quant-ph"
],
"journal_ref": "IEEE Trans. Information Theory, vol. 51, no. 12, pp. 4263--4277,\n 2005",
"title": "Information Rates Achievable with Algebraic Codes on Quantum Discrete Memoryless Channels",
"url": "https://arxiv.org/abs/quant-ph/0207113"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "15e119af-3ff6-4438-a847-9d76e7a6aa4d",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}