Work

Efficient decoding of random errors for quantum expander codes

Year: 2018

Type: conference-paper

Abstract: We show that quantum expander codes, a constant-rate family of quantum low-density parity check (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.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/3188745.3188886

Authors: Omar Fawzi, Antoine Grospellier, Anthony Leverrier

Institutions: École Normale Supérieure de Lyon, Institut national de recherche en sciences et technologies du numérique

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Agence Nationale de la Recherche, Agence Nationale pour le Développement de la Recherche en Santé, QuantERA

OpenAlex ID: W2768757091

FWCI: 0.089

Cites: 30

Cited by: 3

Related to: 10