Quantum Expander Codes

Abstract : We present an efficient decoding algorithm for constant rate quantum hyper graph-product LDPC codes which provably corrects adversarial errors of weight proportional to the code minimum distance, or equivalently to the square-root of the block length. The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from.
Type de document :
Communication dans un congrès
FOCS 2015 - IEEE Annual Symposium on the Foundations of Computer Science, Oct 2015, Berkeley, United States. IEEE, pp.810-824, 2015, 〈10.1109/FOCS.2015.55〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01244657
Contributeur : Jean-Pierre Tillich <>
Soumis le : mercredi 16 décembre 2015 - 09:56:00
Dernière modification le : mardi 17 avril 2018 - 11:24:21

Lien texte intégral

Identifiants

Collections

Citation

Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor. Quantum Expander Codes. FOCS 2015 - IEEE Annual Symposium on the Foundations of Computer Science, Oct 2015, Berkeley, United States. IEEE, pp.810-824, 2015, 〈10.1109/FOCS.2015.55〉. 〈hal-01244657〉

Partager

Métriques

Consultations de la notice

104