REVIEW 1 cited by
Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound
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
abstract
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at a coding rate of 1/3, achieves a frame error rate as low as $10^{-4}$ at a physical error rate of 9.45% for a code with 104,000 logical qubits and 312,000 physical qubits, approaching the quantum hashing bound. These findings highlight the critical role of degeneracy in closing the gap to the fundamental limits of quantum error correction.
Forward citations
Cited by 1 Pith paper
-
Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding
Joint belief propagation decoding of quantum QC-LDPC codes produces sharp error-rate transitions, with error floors dominated by few-bit error patterns.
Discussion (0). Continue with ORCID to comment.