I will give an overview of what I see as some of the most important future directions in the
theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the …

Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and
good code distance scaling, potentially enabling low-overhead fault-tolerant quantum …

We construct a new explicit family of good quantum low-density parity-check codes which
additionally have linear time decoders. Our codes are based on a three-term chain (2 m× m) …

Standard approaches to quantum error correction for fault-tolerant quantum computing are
based on encoding a single logical qubit into many physical ones, resulting in asymptotically …

Quantum Tanner codes constitute a family of quantum low-density parity-check codes with
good parameters, ie, constant encoding rate and relative distance. In this article, we prove …

We introduce and analyse an efficient decoder for quantum Tanner codes that can correct
adversarial errors of linear weight. Previous decoders for quantum low-density parity-check …

Constant-rate low-density parity-check (LDPC) codes are promising candidates for
constructing efficient fault-tolerant quantum memories. However, if physical gates are …

We propose a post-processing method for message-passing (MP) decoding of CSS
quantum LDPC codes, called stabilizer-inactivation (SI). It relies on inactivating a set of …

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 …

We study parallel fault-tolerant quantum computing for families of homological quantum low-
density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant …