Quantum Expander Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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.

Dates and versions

hal-01244657 , version 1 (16-12-2015)

Identifiers

Cite

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⟩

Collections

CNRS INRIA INRIA2
283 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More