dorsal/arxiv
View SchemaConcatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
| Authors | Mitsuru Hamada |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0610195 |
| URL | https://arxiv.org/abs/quant-ph/0610195 |
| DOI | 10.1109/TIT.2008.2006416 |
| Journal | IEEE Trans. on Information Theory, vol. 54, no. 12, pp. 5689--5704, 2008 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.
{
"annotation_id": "37e2c840-4949-481e-a9be-8a8abffbca0f",
"date_created": "2026-03-02T18:02:31.194000Z",
"date_modified": "2026-03-02T18:02:31.194000Z",
"file_hash": "9fd33000323d92ff4bc77fd883a888e42803a1dbbfc82eab14ebbe93177e0e23",
"private": false,
"record": {
"abstract": "A method for concatenating quantum error-correcting codes is presented. The\nmethod is applicable to a wide class of quantum error-correcting codes known as\nCalderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate\nin the Shannon theoretic sense and that are decodable in polynomial time are\npresented. The rate is the highest among those known to be achievable by CSS\ncodes. Moreover, the best known lower bound on the greatest minimum distance of\ncodes constructible in polynomial time is improved for a wide range.",
"arxiv_id": "quant-ph/0610195",
"authors": [
"Mitsuru Hamada"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TIT.2008.2006416",
"journal_ref": "IEEE Trans. on Information Theory, vol. 54, no. 12, pp.\n 5689--5704, 2008",
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction",
"url": "https://arxiv.org/abs/quant-ph/0610195"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "82cad44a-315e-465e-9a52-b27fa203c655",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}