SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Topological Codes from Space Groups: A Route beyond Translation Invariance
Framework constructs CSS topological codes from space groups via invariant theory, giving criteria for topological order and anyon counting while claiming enhanced locality.
-
Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening
Degeneracy in quantum LDPC codes equals classical code shortening at the decoder, enabling impulse decoding that beats BP+OSD plus a residual-error follow-up step.
-
Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction
Extending affine subcode ensemble decoding to quantum codes with overcomplete matrices improves convergence and reduces logical error rates for toric and generalized bicycle codes.
-
Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction
Extending affine subcode ensemble decoding to quantum codes with overcomplete matrices improves BP convergence and reduces logical error rates on toric and generalized bicycle codes.
-
Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel
Bivariate bicycle codes achieve an asymptotic threshold of approximately 0.488 on the quantum erasure channel with BP-OSD decoding, offering modest threshold edge and 12x lower overhead than toric codes under fair baselines.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.