dorsal/arxiv
View SchemaTheory of Quantum Error Correction for General Noise
| Authors | Emanuel Knill, Raymond Laflamme, Lorenza Viola |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9908066 |
| URL | https://arxiv.org/abs/quant-ph/9908066 |
Abstract
Quantum error correction protects quantum information against environmental noise. When using qubits, a measure of quality of a code is the maximum number of errors that it is able to correct. We show that a suitable notion of ``number of errors'' e makes sense for any system in the presence of arbitrary environmental interactions. In fact, the notion is directly related to the lowest order in time with which uncorrectable errors are introduced, and this in turn is derived from a grading of the algebra generated by the interaction operators. As a result, e-error-correcting codes are effective at protecting quantum information without requiring the usual assumptions of independence and lack of correlation. We prove the existence of large codes for both quantum and classical information. By viewing error-correcting codes as subsystems, we relate codes to irreducible representations of certain operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes. An explicit example involving collective interactions is discussed.
{
"annotation_id": "751add49-b357-4bf0-85b8-55d9687d6354",
"date_created": "2026-03-02T18:02:47.727000Z",
"date_modified": "2026-03-02T18:02:47.727000Z",
"file_hash": "83f564f0f65b8ec2dc94d6812f59b1889921551b4e3c3165e030d2ac2ee88860",
"private": false,
"record": {
"abstract": "Quantum error correction protects quantum information against environmental\nnoise. When using qubits, a measure of quality of a code is the maximum number\nof errors that it is able to correct. We show that a suitable notion of\n``number of errors\u0027\u0027 e makes sense for any system in the presence of arbitrary\nenvironmental interactions. In fact, the notion is directly related to the\nlowest order in time with which uncorrectable errors are introduced, and this\nin turn is derived from a grading of the algebra generated by the interaction\noperators. As a result, e-error-correcting codes are effective at protecting\nquantum information without requiring the usual assumptions of independence and\nlack of correlation. We prove the existence of large codes for both quantum and\nclassical information. By viewing error-correcting codes as subsystems, we\nrelate codes to irreducible representations of certain operator algebras and\nshow that noiseless subsystems are infinite-distance error-correcting codes. An\nexplicit example involving collective interactions is discussed.",
"arxiv_id": "quant-ph/9908066",
"authors": [
"Emanuel Knill",
"Raymond Laflamme",
"Lorenza Viola"
],
"categories": [
"quant-ph"
],
"title": "Theory of Quantum Error Correction for General Noise",
"url": "https://arxiv.org/abs/quant-ph/9908066"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "30d7724e-35ef-4c3a-bbfa-412f0b9702f2",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}