Quantum Expander Codes

Abstract : We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight growing like the square-root of the length of the code. 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.
Document type :
Conference papers
Complete list of metadatas

Contributor : Anthony Leverrier <>
Submitted on : Friday, December 2, 2016 - 10:23:30 AM
Last modification on : Wednesday, December 25, 2019 - 1:10:26 AM


  • HAL Id : hal-01407431, version 1



Anthony Leverrier. Quantum Expander Codes. Beyond i.i.d. in Information Theory, Jul 2016, Barcelone, Spain. ⟨hal-01407431⟩



Record views