We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU(
d) errors. We find that under this recursive scheme, the asymptotic encoding rate is
1/d.
We prove a fault-tolerance theorem for quantum computation against adversarial noise. For every quantum circuit on
Nˉ logical qudits of depth
Tˉ, we construct a fault-tolerant circuit on
N=poly(Nˉ) physical qudits of depth
Tˉ⋅Nˉo(1), which is robust against an adversary who may arbitrarily choose and corrupt an almost-linear number
N1−o(1) of physical qudits at each time step. This robustness significantly improves upon prior fault-tolerance theorems, which assumed corruptions were either local and stochastic, or else only act on a polynomially vanishing fraction of qudits.
Our fault-tolerance scheme addresses a key bottleneck towards constructing quantum PCPs via the circuit-to-Hamiltonian mapping of Anshu, Breuckmann, and Nguyen (STOC'24). More fundamentally, our result demonstrates that fault-tolerant quantum computation remains possible under noise models that are global, worst-case, and non-Markovian over the full duration of the computation, directly countering concerns that correlated noise could fundamentally undermine quantum fault tolerance.
Our construction is based on a new family of subsystem product codes we develop, which have large dimension and distance along with low-weight parity-checks, and which support transversal non-Clifford gates. We show how to perform single-shot fault-tolerant error correction on these codes using a Floquet-like procedure based on the local testability of classical tensor codes. We then obtain a universal fault-tolerance scheme using repeated code switching in a hypercubic qudit architecture. Finally, we recursively compose our scheme with itself to reduce an initially exponential qudit dimension down to a constant.