Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Wednesday, December 16, 2015 - 9:56:00 AM
Last modification on : Friday, January 21, 2022 - 3:22:36 AM

Links full text




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. pp.810-824, ⟨10.1109/FOCS.2015.55⟩. ⟨hal-01244657⟩



Record views