Pith. sign in

REVIEW 2 cited by

Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases

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 2403.12119 v3 pith:DCR3JSND submitted 2024-03-18 quant-ph cond-mat.str-el

classification quant-phcond-mat.str-el
keywords circuitscodetopologicaltoricabelianphasequantumfault-tolerant
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits, realizing any abelian non-chiral topological phase as an actively error-corrected fault-tolerant memory. These circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals, which we express through cellular cohomology and higher-order cup products. The specific path integral we use is the abelian Dijkgraaf-Witten state sum on a 3-dimensional cellulation, which is a spacetime representation of the twisted quantum double model. The resulting circuits are based on a syndrome extraction circuit of the (qudit) stabilizer toric code, into which we insert non-Clifford phase gates that implement the ``twist''. The overhead compared to the toric code is moderate, in contrast to known constructions for twisted abelian phases. We also show that other architectures for the (qudit) toric code phase, like measurement-based topological quantum computation or Floquet codes, can be enriched with phase gates to implement twisted quantum doubles instead of their untwisted versions. As a further result, we prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits that we call 1-form symmetric fixed-point circuits. This notion unifies the circuits in this paper as well as the stabilizer toric code, subsystem toric code, measurement-based topological quantum computation, or the (CSS) honeycomb Floquet code. We also demonstrate how our method can be adapted to construct fault-tolerant circuits for specific non-Abelian phases. In the appendix we present an explicit combinatorial procedure to define formulas for higher cup products on arbitrary cellulations, which might be interesting in its own right to the TQFT and topological-phases community.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Planar fault-tolerant circuits for non-Clifford gates on the 2D color code

    quant-ph 2025-05 conditional novelty 8.0 of 10

    The paper constructs a family of planar fault-tolerant 'twisted color circuits' that implement logical T gates and magic-state measurements on the 2D color code via a path-integral and color-cohomology framework.

  2. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0 of 10

    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.

Pith tools