Work

Decoding Quantum Tanner Codes

Year: 2023

Type: article

Abstract: We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum low-density parity-check codes. In this case, our decoders provably correct arbitrary errors of weight linear in the code length, respectively in linear or logarithmic time. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev. Along the way, we exploit recently established bounds on the robustness of random tensor codes to give a tighter bound on the minimum distance of quantum Tanner codes.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2023.3267945

Authors: Anthony Leverrier, Gilles Zémor

Institutions: Institut national de recherche en sciences et technologies du numérique, Institut de Mathématiques de Bordeaux

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Awards: G1190173965, Quantum algorithms for massive data, G4656594441, From NISQ to LSQ: Bosonic and LDPC codes