REVIEW 6 cited by
Automorphism Ensemble Decoding of Quantum LDPC 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
read the original abstract
We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. Our decoder employs a set of automorphisms of the quantum code and an ensemble of belief propagation (BP) decoders. Each BP decoder is given a syndrome which is transformed by one of the automorphisms, and is run in parallel. For quantum codes, the accuracy of BP decoders is limited because short cycles occur in the Tanner graph and our approach mitigates this effect. We demonstrate decoding accuracy comparable to BP-OSD-0 with a lower time overhead for Quantum Reed-Muller (QRM) codes in the code capacity setting, and Bivariate Bicycle (BB) codes under circuit level noise. We provide a Python repository for use by the community and the results of our simulations.
Forward citations
Cited by 6 Pith papers
-
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Unfolded distillation prepares an |X^{1/4}> magic state with logical error 3e-7 using 53 biased-noise qubits and 5.5 rounds, by unfolding the 3D Reed-Muller X-stabilizers into a 2D layout.
-
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Two new quasi-dyadic dual-containing CSS LDPC families are claimed to beat bicycle codes in finite-length simulations while enabling transversal Hadamard and BP2 decoding.
-
Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes
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.
-
Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization
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.
-
Automorphism gadgets in homological product codes
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...
-
Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD
A syndrome-flipping belief-propagation decoder with parallel trial attempts matches BP-OSD logical error rates while avoiding Gaussian elimination and shortening average latency.
Discussion (0). Sign in to comment.