Section: New Results
Quantum LDPC codes
Quantum codes are the analogous of error correcting codes
for a quantum computer. A well known family of quantum codes
are the CSS codes due to Calderbank, Shor and Steane
can be represented by a pair of matrices
In an article in preparation, Benjamin Audoux (I2M, Marseille) and A. Couvreur
investigate a problem suggested by Bravyi and Hastings. They studied the
behaviour of iterated tensor powers of CSS codes and prove in
particular that such families always have a minimum distance tending to
infinity. They propose also 3 families of LDPC codes whose minimum
distance is in