Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising examples of diagnostic versus syndrome measurements.
Unifying flavors of fault tolerance with the ZX calculus
1 Pith paper cite this work, alongside 39 external citations. Polarity classification is still indexing.
abstract
There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We focus on models of topological fault tolerance - specifically surface codes - including circuit-based, measurement-based and fusion-based quantum computation, as well as the recently introduced model of Floquet codes. We find that all of these models can be viewed as different flavors of the same underlying stabilizer fault-tolerance structure, and sustain this through a set of local equivalence transformations which allow mapping between flavors. We anticipate that this unifying perspective will pave the way to transferring progress among the different views of stabilizer fault-tolerance and help researchers familiar with one model easily understand others.
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A diagrammatic field theory of quantum error correction
Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising examples of diagnostic versus syndrome measurements.