Efficient decoding of random errors for quantum expander codes

325 views · Published 12 December 2017 · 40:06 · Indexed 23 October 2026

Channel: Institut Henri Poincaré · 2017 · Science & Technology

Watch on YouTube

By Anthony Leverrier (INRIA)
Abstract: We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of [1] can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a
linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottesman's construction of fault tolerant schemes with constant space overhead. 
Joint work with Antoine Grospellier and Omar Fawzi
[1] https://arxiv.org/abs/1504.00822

More from this channel