Pith. sign in

REVIEW 8 cited by

Quantum Low-Density Parity-Check 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 2103.06309 v2 pith:7R4MJZ3S submitted 2021-03-10 quant-ph

classification quant-ph
keywords quantumcodesdiscussldpclow-densityparity-checkparticularadvances
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. The codes we discuss are alternatives to the surface code, which is the currently leading candidate to implement quantum fault-tolerance. We introduce the zoo of LDPC quantum codes and discuss their potential for making quantum computers robust against noise. In particular, we explain recent advances in the theory of LDPC quantum codes related to certain product constructions and discuss open problems in the field.

Discussion (0). Sign in to comment.

Forward citations

Cited by 8 Pith papers

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

  1. In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes

    quant-ph 2026-04 unverdicted novelty 8.0 of 10

    A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showin...

  2. Logical Spectroscopy: Lifted-Product Codes with Addressable Bases

    quant-ph 2026-07 accept novelty 7.0 of 10

    Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...

  3. The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

    quant-ph 2026-02 unverdicted novelty 7.0 of 10

    Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.

  4. Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.

  5. Approximating optimal decoding of quantum LDPC codes with narrow frontiers

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance wi...

  6. Low-overhead fault-tolerant quantum computation by gauging logical operators

    quant-ph 2024-10 unverdicted novelty 6.0 of 10

    Introduces a gauging-based method for fault-tolerant logical measurement achieving qubit overhead linear in operator weight up to polylog factors, adaptable to arbitrary codes.

  7. Mixed-state topological order and the errorfield double formulation of decoherence-induced transitions

    quant-ph 2023-01 unverdicted novelty 6.0 of 10

    Decoherence on abelian topological order is modeled as a temporal defect in double TQFT driving boundary anyon condensation transitions classified by Lagrangian subgroups of the doubled order.

  8. Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits

    quant-ph 2026-01 reject novelty 4.0 of 10

    The main theorem claiming constant-depth logical CCZ gates exist from many 'magic-friendly triples' has mutually inconsistent hypotheses, and its key local-implementation step is unproved.

Pith tools