Pith. sign in

REVIEW 4 cited by

The Physics of (good) LDPC Codes II. Product constructions

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 2402.16831 v1 pith:SPOC47DL submitted 2024-02-26 quant-ph cond-mat.stat-mechhep-th

classification quant-phcond-mat.stat-mechhep-th
keywords codesproductclassicalconstructionseuclideanphasesquantumcode
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We continue the study of classical and quantum low-density parity check (LDPC) codes from a physical perspective. We focus on constructive approaches and formulate a general framework for systematically constructing codes with various features on generic Euclidean and non-Euclidean graphs. These codes can serve as fixed-point limits for phases of matter. To build our machinery, we unpack various product constructions from the coding literature in terms of physical principles such as symmetries and redundancies, introduce a new cubic product, and combine these products with the ideas of gauging and Higgsing introduced in Part I. We illustrate the usefulness of this approach in finite Euclidean dimensions by showing that using the one-dimensional Ising model as a starting point, we can systematically produce a very large zoo of classical and quantum phases of matter, including type I and type II fractons and SPT phases with generalized symmetries. We also use the balanced product to construct new Euclidean models, including one with topological order enriched by translation symmetry, and another exotic fracton model whose excitations are formed by combining those of a fractal spin liquid with those of a toric code, resulting in exotic mobility constraints. Moving beyond Euclidean models, we give a review of existing constructions of good qLDPC codes and classical locally testable codes and elaborate on the relationship between quantum code distance and classical energy barriers, discussed in Part I, from the perspective of product constructions.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Stable valleys in the glassy landscape of a low-density parity-check (LDPC) code

    cond-mat.stat-mech 2026-07 conditional novelty 6.0 of 10

    For the Tanner-Hamming [7,4,3] LDPC model on a high-girth random regular graph, low-energy valleys separate canonical and microcanonical instability, yielding ensemble inequivalence in a non-random, unfrustrated spin glass.

  2. Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors

    cs.IT 2025-08 unverdicted novelty 6.0 of 10

    New minimum-distance bounds for generalized bicycle codes are used to construct two degree-4 check families, [[d^2+1,2,d]] and [[d^2,2,d]], with surface-code-comparable simulated thresholds and a logical CNOT via relabeling.

  3. Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization

    cs.CL 2025-08 unverdicted novelty 6.0 of 10

    Parity-aware BPE, which prioritizes the worst-compressed language at each merge, cuts cross-lingual tokenization inequality by up to 89% at negligible global cost.

  4. Automorphism gadgets in homological product codes

    quant-ph 2025-08 unverdicted novelty 6.0 of 10

    Permutation automorphisms of input codes induce logical operations on homological product codes, implementable by physical qubit permutations plus a subsystem circuit, with effective distance preservation when permuta...

Pith tools