Pith. sign in

REVIEW 4 cited by

SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry

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 2412.02885 v1 pith:S4GVHT33 submitted 2024-12-03 quant-ph

classification quant-ph
keywords decodingquantumcodesqldpcsymbreakcompareddecoderstimes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum error correction (QEC) is critical for scalable and reliable quantum computing, but existing solutions, such as surface codes, incur significant qubit overhead. Quantum low-density parity check (qLDPC) codes have recently emerged as a promising alternative, requiring fewer qubits. However, the lack of efficient decoders remains a major barrier to their practical implementation. In this work, we introduce SymBreak, a novel decoder for qLDPC codes that adaptively modifies the decoding graph to improve the performance of state-of-the-art belief propagation (BP) decoders. Our key contribution is identifying quantum degeneracy as a root cause of the convergence issues often encountered in BP decoding of quantum LDPC codes. We propose a solution that mitigates this issue at the decoding graph level, achieving both fast and accurate decoding. Our results demonstrate that SymBreak outperforms BP and BP+OSD-a more complex variant of BP-with a $16.17\times$ reduction in logical error rate compared to BP and $3.23\times$ compared to BP+OSD across various qLDPC code families. With only an $18.97$% time overhead compared to BP, SymBreak provides significantly faster decoding times than BP+OSD, representing a major advancement in efficient and accurate decoding for qLDPC-based QEC architectures.

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. Topological Codes from Space Groups: A Route beyond Translation Invariance

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    Space-group codes—CSS codes whose stabilizers use crystallographic point-group symmetries—can be topologically ordered and geometrically local, and some match or beat bivariate-bicycle benchmarks.

  2. Scalable decoding protocols for fast transversal logic in the surface code

    quant-ph 2025-05 conditional novelty 7.0 of 10

    The paper presents windowed decoding protocols that restore modularity and locality to decoding of fast transversal logic, enabling constant-time logical gates with scalable error correction.

  3. Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes

    quant-ph 2025-10 conditional novelty 6.0 of 10

    A local O(n) post-processor called degeneracy cutting prunes one low-probability qubit per stabilizer and reruns belief propagation, matching or beating BP+OSD accuracy in several qLDPC settings.

  4. Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A syndrome-flipping belief-propagation decoder with parallel trial attempts matches BP-OSD logical error rates while avoiding Gaussian elimination and shortening average latency.

Pith tools