dorsal/arxiv
View SchemaCodes for the Quantum Erasure Channel
| Authors | Markus Grassl, Thomas Beth, Thomas Pellizzari |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9610042 |
| URL | https://arxiv.org/abs/quant-ph/9610042 |
| DOI | 10.1103/PhysRevA.56.33 |
| Journal | Phys. Rev. A, vol. 56, no. 1, July 1997, pp. 33-38 |
Abstract
The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i. e., arbitrary errors at known positions. We show that four qubits are necessary and sufficient to encode one qubit and correct one erasure, in contrast to five qubits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum BCH codes, that can be efficiently decoded is introduced.
{
"annotation_id": "f71d0969-bc02-446e-9fd9-219a4ea85d78",
"date_created": "2026-03-02T18:02:37.470000Z",
"date_modified": "2026-03-02T18:02:37.470000Z",
"file_hash": "1a49714ec0069c84246440620c20fdaaf005d35ada7f7b753cb83ffeb9af6f16",
"private": false,
"record": {
"abstract": "The quantum erasure channel (QEC) is considered. Codes for the QEC have to\ncorrect for erasures, i. e., arbitrary errors at known positions. We show that\nfour qubits are necessary and sufficient to encode one qubit and correct one\nerasure, in contrast to five qubits for unknown positions. Moreover, a family\nof quantum codes for the QEC, the quantum BCH codes, that can be efficiently\ndecoded is introduced.",
"arxiv_id": "quant-ph/9610042",
"authors": [
"Markus Grassl",
"Thomas Beth",
"Thomas Pellizzari"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.56.33",
"journal_ref": "Phys. Rev. A, vol. 56, no. 1, July 1997, pp. 33-38",
"title": "Codes for the Quantum Erasure Channel",
"url": "https://arxiv.org/abs/quant-ph/9610042"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5ff1af4a-7d0b-4d91-a9ae-6c0164434c23",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}