Researchers prove a new fault‑tolerance theorem that lets a quantum computation succeed even if an adversary corrupts an almost‑linear number of physical qudits at every time step. A qudit is a quantum information carrier with q possible levels (a generalization of a qubit). The paper constructs a procedure that turns any logical quantum circuit with barN logical qudits and depth barT into a physical circuit on N ≤ barN^{5+ε} qudits and time T ≤ barT·2^{O(√log barN)}. The compiled circuit is provably robust to adversarial corruptions on about N/2^{O(√log N)} qudits per step, which the authors describe as an N^{1-o(1)} (almost‑linear) number of corruptions.

To get this robustness the authors build a new family of quantum error‑correcting codes they call subsystem product codes. These codes are designed to have both large logical capacity and large error‑distance, while keeping the checks that detect errors relatively simple and local. The construction also supports certain gates applied across the code without spreading errors badly (so‑called transversal non‑Clifford gates). For error correction they use a single‑shot, Floquet‑like procedure inspired by classical tensor codes that can test and fix errors locally. The scheme also uses repeated code switching on a hypercubic layout of qudits, and a recursive composition step that reduces an initially large qudit dimension down to a constant.

Why this matters: previous rigorous fault‑tolerance results against adversarial noise could only handle a much smaller number of corruptions per step. Earlier constructions could tolerate at most O(N^{1/3}) corrupted qudits per step (that is, a fraction about N^{-2/3}). The new theorem allows a super‑polynomial improvement in that tolerated fraction. The result also addresses a long‑standing worry that strongly correlated, global, or worst‑case noise might make quantum fault tolerance impossible. The authors point out this robustness could serve as a building block toward quantum probabilistically checkable proofs (qPCPs), where one needs fault‑tolerance against large, structured errors to map circuits to local quantum Hamiltonians.