Pith. sign in

REVIEW 3 cited by

Unifying flavors of fault tolerance with the ZX calculus

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.08829 v3 pith:5O43UJKJ submitted 2023-03-15 quant-ph

Unifying flavors of fault tolerance with the ZX calculus

classification quant-ph
keywords modelsdifferentfault-toleranceflavorsunifyingcalculuscodescomputation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spacetime Layout and Logical Compilation of Color Code

    quant-ph 2026-07 conditional novelty 7.0

    An automated color-code logical compiler maps Clifford+T circuits to admissible spacetime block layouts via edge-decorated ZX diagrams and fusion-region-aware routing, beating reported surface-code volumes on nine benchmarks.

  2. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0

    Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.

  3. A diagrammatic field theory of quantum error correction

    quant-ph 2026-07 conditional novelty 6.5

    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 e...