Pith. sign in

REVIEW 1 cited by

Locality-Preserving Logical Operators in Topological Stabiliser Codes

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 1709.00020 v3 pith:5DICGJJA submitted 2017-08-31 quant-ph cond-mat.str-el

Locality-Preserving Logical Operators in Topological Stabiliser Codes

classification quant-ph cond-mat.str-el
keywords codesoperatorslocality-preservinglogicalproceduretopologicalstabiliserabelian
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Locality-preserving logical operators in topological codes are naturally fault-tolerant, since they preserve the correctability of local errors. Using a correspondence between such operators and gapped domain walls, we describe a procedure for finding all locality-preserving logical operators admitted by a large and important class of topological stabiliser codes. In particular, we focus on those equivalent to a stack of a finite number of surface codes of any spatial dimension, where our procedure fully specifies the group of locality-preserving logical operators. We also present examples of how our procedure applies to codes with different boundary conditions, including colour codes and toric codes, as well as more general codes such as abelian quantum double models and codes with fermionic excitations in more than two dimensions.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. A conditional no-go for resource-free magic-axis measurement on a static surface code

    eess.SY 2026-07 conditional novelty 6.0

    Under three stated assumptions, a resource-free static surface-code patch cannot sharply measure the magic axis at polynomial acceptance; it must pay with a resource, leave the dilute regime, or accept exponentially rarely.