Intrinsic locality dimension of quantum codes

Esther Xiaozhen Fu; Yimin Lu; Zi-Wen Liu

Intrinsic locality dimension of quantum codes

T0 review · 0 major / 2 minor · reviewed 2026-06-28 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Stabilizer quantum codes possess an intrinsic locality dimension that limits their parameters and compatible fault-tolerant gates without reference to any fixed background geometry.

desk verdict New intrinsic locality dimension generalizes two classic bounds on stabilizer codes to flexible geometries, but the value hinges on whether the definition holds up in the proofs. read the letter →

arxiv 2605.31441 v2 pith:WWXM43NI submitted 2026-05-29 quant-ph

Yimin Lu , Esther Xiaozhen Fu , Zi-Wen Liu This is my paper · ORCID

classification quant-ph

keywords quantumerror-correctingcodesstabilizerintrinsiclocalitydimensionfault-tolerantgatestopologicalalgebraicself-correctingmemories

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper defines an intrinsic locality dimension for stabilizer codes by adapting tools from fractal geometry and geometric measure theory. This dimension functions as an organizing parameter that applies uniformly to topological codes, algebraic constructions such as bivariate-bicycle codes, and other flexible architectures, including non-integer values. It yields general bounds on code parameters and on the logical gates that admit fault-tolerant implementations, extending earlier results that assumed regular lattices. The same parameter produces a conditional prohibition on self-correcting quantum memories in any dimension strictly less than three.

What carries the argument

The intrinsic locality dimension, a real-valued locality measure for codes that is independent of embedding geometry and accommodates flexible and non-integer cases.

What would settle it

A concrete stabilizer code family whose measured intrinsic dimension permits code parameters or logical gates that exceed the derived general bounds.

Watch

Extended reading notes

Core claim

The intrinsic locality dimension of stabilizer codes, defined independently of background geometry via fractal geometry and geometric measure theory, serves as a fundamental organizing parameter that induces general limitations on code parameters and on the fault-tolerant logical gates compatible with those codes.

Load-bearing premise

The intrinsic locality dimension is well-defined for the stabilizer codes under consideration and captures the locality properties that govern their parameters and gates.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

read the letter

The main takeaway is that the authors define an intrinsic locality dimension for stabilizer codes, pulled from fractal geometry and geometric measure theory, and use it to extend the Bravyi-Poulin-Terhal bound on code parameters and the Bravyi-König bound on logical gates beyond regular topological codes. This covers algebraic families like bivariate-bicycle codes and allows non-integer values without a fixed background lattice.

The work does a clean job of treating the dimension as an organizing parameter that unifies several limitations in one place. The conditional no-go result for self-correcting memories below dimension 3 is a direct consequence they draw out, which could matter for memory design if the conditions are realistic.

The soft spot is the new definition. It needs to demonstrably capture the locality properties that matter for these codes without post-hoc tuning or extra restrictions that limit the generalizations. The abstract alone does not show the construction or the proof steps, so it is unclear how much the results actually rely on the fractal machinery versus standard arguments. If the proofs go through cleanly, the unification is useful; if they require case-by-case adjustments, the gain shrinks.

This is aimed at people working on dimensional constraints in quantum codes and fault tolerance. A reader already familiar with the original BPT and BK bounds will see the extension quickly.

It deserves peer review because the claimed generalizations are concrete and the mathematical tools are standard in related fields. The paper should go out for refereeing.

Referee Report

0 major / 2 minor

Summary. The manuscript introduces an intrinsic locality dimension for stabilizer codes, defined independently of background geometry via tools from fractal geometry and geometric measure theory. This dimension is positioned as an organizing parameter that unifies code properties across topological and algebraic families (including bivariate-bicycle codes). The central results are general bounds on code parameters and on compatible fault-tolerant logical gates that generalize the Bravyi-Poulin-Terhal and Bravyi-König theorems, respectively, together with a conditional no-go theorem for self-correcting quantum memories in dimension 3-ε.

Significance. If the claimed generalizations hold, the work supplies a dimension-based unification that extends known no-go results beyond regular lattices to non-integer and flexible architectures. The explicit use of geometric measure theory to accommodate non-integer dimensions and the conditional thermal-stability result constitute concrete strengths that could influence both code design and the study of self-correction.

minor comments (2)

The abstract states that the dimension 'naturally incorporates flexible architectures,' but the manuscript should include at least one explicit calculation for a bivariate-bicycle code showing how the new dimension is computed and recovers the expected locality properties.
Notation for the intrinsic dimension (presumably introduced in an early section) should be compared side-by-side with the classical Hausdorff dimension to clarify the precise technical departure.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and for the positive assessment of the potential significance of the intrinsic locality dimension as a unifying parameter. We note that the referee has not raised any specific major comments or questions about the manuscript.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The paper introduces a new intrinsic locality dimension drawn from established tools in fractal geometry and geometric measure theory, then uses it as an organizing parameter to generalize existing bounds (Bravyi-Poulin-Terhal, Bravyi-König) to broader stabilizer code families. No load-bearing step reduces by construction to a fitted parameter, self-citation chain, or self-referential definition; the derivation chain remains self-contained against external mathematical machinery and does not rename or smuggle prior results via internal citations.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claims rest on the applicability of fractal geometry and geometric measure theory to define a dimension for stabilizer codes and on the assumption that this dimension controls code parameters and gate sets in the stated way.

assumptions (1)

domain assumption Mathematical machinery from fractal geometry and geometric measure theory applies directly to stabilizer codes and yields a well-defined intrinsic locality dimension.
Invoked to introduce the core new object in the abstract.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Intrinsic locality dimension of quantum codes." pith.science (2026). https://pith.science/paper/WWXM43NI

@misc{pith2026260531441,
  author       = {Pith},
  title        = {Pith review of: Intrinsic locality dimension of quantum codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WWXM43NI}},
  note         = {Machine review of arXiv:2605.31441}
}

abstract

Quantum error-correcting codes are a cornerstone of quantum computing, with broad and profound connections to physics and mathematics. In this work, we introduce the notion of intrinsic locality dimension of stabilizer codes, which is independent of the underlying geometry of quantum codes and naturally extends to non-integer values. Drawing on mathematical tools from fractal geometry and geometric measure theory, the intrinsic locality dimension accommodates flexible architectures and provides a quantitative measure of code connectivity, encompassing both topological codes and algebraic constructions such as bivariate-bicycle-type codes. We show how the intrinsic dimension serves as a fundamental organizing parameter that unifies code properties. In particular, we prove general limitations on code parameters and compatible fault-tolerant logical gates induced by the intrinsic dimension, generalizing the Bravyi--Poulin--Terhal and Bravyi--K\"{o}nig bounds for regular topological codes, respectively. Furthermore, we consider implications on thermal properties: toward fully characterizing the geometry requirement for self-correcting quantum memories (SCQMs), we present a conditional no-go result for SCQMs in dimension $3-\epsilon$ and take stock of existing results on low-dimensional SCQMs. Our theory provides a unifying mathematical framework for understanding the fundamental capabilities and geometric implementations of quantum error correction and fault tolerance.

Figures

Figures reproduced from arXiv: 2605.31441 by the authors.

**Figure 2.** FIG. 2. Representetive self-similar quasi-convex fractal mod [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

**Figure 3.** FIG. 3. Illustration of the mapping from 3D toric code to 2D planar code with long range connectivity: the [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗

Figures from the paper (5 more)

**Figure 4.** Figure 4: FIG. 4. Illustration of the generalized BPT partition. (a) A tri-partition for a triangle. (b) [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]

**Figure 5.** Figure 5: FIG. 5. Illustration of multi-code-block gates. The red dot [PITH_FULL_IMAGE:figures/full_fig_p016_5.png]

**Figure 6.** Figure 6: FIG. 6. The quasi-tube [PITH_FULL_IMAGE:figures/full_fig_p031_6.png]

**Figure 7.** Figure 7: FIG. 7. A logical operator in the fractalized one-dimensional Ising model. Although the operator has fractal support, the [PITH_FULL_IMAGE:figures/full_fig_p035_7.png]

**Figure 8.** Figure 8: FIG. 8. A two-dimensional layout of the fractalized one-dimensional cluster model. Each orange circle denotes one site [PITH_FULL_IMAGE:figures/full_fig_p035_8.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

Lifting Lifted Product Codes
quant-ph 2026-07 conditional novelty 6.5 of 10

Group-extension lifts systematically enlarge any LP code, transfer logical gadgets via chain maps (often with less surgery overhead), improve some code parameters, and give candidate thermodynamic families with cohere...

Pith tools

Reviewed June 28, 2026 · model on record in the stance chip above.