LEVERRIER, Anthony; TILLICH, Jean-Pierre; ZÉMOR, Gilles

doi:10.1109/FOCS.2015.55

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

LEVERRIER, Anthony
Security, Cryptology and Transmissions [SECRET]

TILLICH, Jean-Pierre
Security, Cryptology and Transmissions [SECRET]

ZÉMOR, Gilles
Institut de Mathématiques de Bordeaux [IMB]

Idioma

Communication dans un congrès

Este ítem está publicado en

FOCS 2015 - IEEE Annual Symposium on the Foundations of Computer Science, 2015-10-18, Berkeley. 2015-10p. 810-824

IEEE

Resumen en inglés

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.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

Quantum Expander Codes

Idioma

Este ítem está publicado en

Resumen en inglés

URI

DOI

Orígen

Centros de investigación