dorsal/arxiv
View SchemaUpper Bounds on the Size of Quantum Codes
| Authors | Alexei Ashikhmin, Simon Litsyn |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9709049 |
| URL | https://arxiv.org/abs/quant-ph/9709049 |
Abstract
Several upper bounds on the size of quantum codes are derived using the linear programming approach. These bounds are strengthened for the linear quantum codes.
{
"annotation_id": "4d5dfa65-c65d-451b-ae85-7caa43837d29",
"date_created": "2026-03-02T18:02:40.576000Z",
"date_modified": "2026-03-02T18:02:40.576000Z",
"file_hash": "8a26eb156acc1038ffd1e200a8b2646c6c971b151483a6816baa0a8026675b0f",
"private": false,
"record": {
"abstract": "Several upper bounds on the size of quantum codes are derived using the\nlinear programming approach. These bounds are strengthened for the linear\nquantum codes.",
"arxiv_id": "quant-ph/9709049",
"authors": [
"Alexei Ashikhmin",
"Simon Litsyn"
],
"categories": [
"quant-ph"
],
"title": "Upper Bounds on the Size of Quantum Codes",
"url": "https://arxiv.org/abs/quant-ph/9709049"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5723c14c-3fa2-4e18-adab-6284ba403a54",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}