Efficient decoding of random errors for quantum expander codes - Archive ouverte HAL Access content directly
Poster Communications Year : 2017

Efficient decoding of random errors for quantum expander codes

Abstract

We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Zémor 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.
Fichier principal
Vignette du fichier
poster.pdf (861.18 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01671496 , version 1 (22-12-2017)

Identifiers

  • HAL Id : hal-01671496 , version 1

Cite

Omar Fawzi, Antoine Grospellier, Anthony Leverrier. Efficient decoding of random errors for quantum expander codes. 8th colloquium of the GDR IQFA - Ingénierie Quantique, des Aspects Fondamentaux aux Applications, Nov 2017, Nice, France. ⟨hal-01671496⟩
246 View
49 Download

Share

Gmail Mastodon Facebook X LinkedIn More