dorsal/arxiv
View SchemaQuantum codes of minimum distance two
| Authors | Eric M. Rains |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9704043 |
| URL | https://arxiv.org/abs/quant-ph/9704043 |
Abstract
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With this in mind, we present a number of results on codes of minimum distance 2. We first compute the linear programming bound on the dimension of such a code, then show that this bound can only be attained when the code either is of even length, or is of length 3 or 5. We next consider questions of uniqueness, showing that the optimal code of length 2 or 4 is unique (implying that the well-known one-qubit-in-five single-error correcting code is unique), and presenting nonadditive optimal codes of all greater even lengths. Finally, we compute the full automorphism group of the more important distance 2 codes, allowing us to determine the full automorphism group of any GF(4)-linear code.
{
"annotation_id": "d0ac3fed-070e-4cf9-a08b-b04c9a412172",
"date_created": "2026-03-02T18:02:41.607000Z",
"date_modified": "2026-03-02T18:02:41.607000Z",
"file_hash": "5b6705e26e8303500fa23f14749e7729ac38d7c2c598e1f0a2b283b910392417",
"private": false,
"record": {
"abstract": "It is reasonable to expect the theory of quantum codes to be simplified in\nthe case of codes of minimum distance 2; thus, it makes sense to examine such\ncodes in the hopes that techniques that prove effective there will generalize.\nWith this in mind, we present a number of results on codes of minimum distance\n2. We first compute the linear programming bound on the dimension of such a\ncode, then show that this bound can only be attained when the code either is of\neven length, or is of length 3 or 5. We next consider questions of uniqueness,\nshowing that the optimal code of length 2 or 4 is unique (implying that the\nwell-known one-qubit-in-five single-error correcting code is unique), and\npresenting nonadditive optimal codes of all greater even lengths. Finally, we\ncompute the full automorphism group of the more important distance 2 codes,\nallowing us to determine the full automorphism group of any GF(4)-linear code.",
"arxiv_id": "quant-ph/9704043",
"authors": [
"Eric M. Rains"
],
"categories": [
"quant-ph"
],
"title": "Quantum codes of minimum distance two",
"url": "https://arxiv.org/abs/quant-ph/9704043"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c4a75a21-f16e-452b-9d62-d58fccea72ec",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}