Contemporary mathematics - American Mathematical Society
Quantum error-correcting codes over finite Frobenius rings
Andreas Klappenecker, Sang-Jun Lee, Andrew Nemec
Abstract
The idealized model of quantum computation promises for certain problems a considerable speed-up over classical computation. However, protecting quantum information requires a considerable effort. We give a brief survey of the construction of quantum error-correcting codes over finite Frobenius rings. We illustrate the construction of families of quantum error-correcting codes that are obtained from quadratic residue codes over finite commutative chain rings.