An Introduction to Quantum Error Correction
| dc.creator | Gottesman, Daniel | |
| dc.date | 2000-04-18 | |
| dc.date.accessioned | 2026-07-07T05:59:52Z | |
| dc.date.available | 2026-07-07T05:59:52Z | |
| dc.description | Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements. | |
| dc.description | 15 pages, AMSLaTeX, talk given at AMS Short Course on Quantum Computation | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0004072 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0004072 | |
| dc.identifier | in Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, ed. S. J. Lomonaco, Jr., pp. 221-235 (American Mathematical Society, Providence, Rhode Island, 2002) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88843 | |
| dc.subject | Quantum Physics | |
| dc.title | An Introduction to Quantum Error Correction | |
| dc.type | text |