REVIEW 17 cited by
Ambiguity Clustering: an accurate and efficient decoder for qLDPC 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
Signed reviews
read the original abstract
Error correction allows a quantum computer to preserve states long beyond the decoherence time of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates the error state of qubits from the results of syndrome measurements. The leading proposal for quantum error correction, the surface code, has fast and accurate decoders, but several recently proposed quantum low-density parity check (qLDPC) codes allow more logical information to be encoded in significantly fewer physical qubits. The state-of-the-art decoder for general qLDPC codes, BP-OSD, has a cheap Belief Propagation stage, followed by linear algebra and search stages which can each be slow in practice. We introduce the Ambiguity Clustering decoder (AC) which, after the Belief Propagation stage, divides the measurement data into clusters that can be decoded independently. We benchmark AC on the recently proposed bivariate bicycle qLDPC codes and find that, with 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy. Our implementation of AC decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU, already fast enough to keep up with neutral atom and trapped ion systems.
Forward citations
Cited by 17 Pith papers
-
Pauli stabilizer formalism for topological quantum field theories and generalized statistics
Explicit Pauli stabilizer models are constructed for higher-form Dijkgraaf-Witten TQFTs and new fermionic/anyonic statistics of loop, membrane, and volume excitations are computed on the lattice.
-
Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware
Directional codes are new quantum LDPC codes whose stabilizer checks run on square or hexagonal grids via iSWAP swaps, matching rotated surface code logical error rates with about a quarter to a half of the physical qubits.
-
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.
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Scalable decoding protocols for fast transversal logic in the surface code
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.
-
A matching decoder for bivariate bicycle codes
The authors introduce symatch, a minimum-weight matching decoder for bivariate bicycle quantum LDPC codes that uses code symmetries and a cylinder trick, and show it is competitive with BP-OSD and tesseract under code...
-
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.
-
Efficient Post-Selection for General Quantum LDPC Codes
Cluster-size and cluster-LLR norm fractions from BP+LSD decoding suppress logical error rates by orders of magnitude at low abort rates on surface, bivariate bicycle, and hypergraph product codes.
-
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.
-
Leveraging biased noise for more efficient quantum error correction at the circuit-level with two-level qubits
Bias-preserving CZ gates plus small residual CNOT bias enable a 90% threshold improvement and up to 75% footprint reduction for the XZZX code in two-level qubits.
-
Turbo-Annihilation of Hook Errors in Stabilizer Measurement Circuits
A turbo-equalization decoder for quantum LDPC codes models hook errors as correlated memory channels and achieves near-BPOSD0 decoding performance with linear complexity.
-
Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
A recurrent transformer decoder trained on circuit-level noise beats BP-OSD on the [[72,12,6]] bivariate bicycle code in logical error rate and runtime consistency, but falls behind on the [[144,12,12]] code.
-
Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning
Searching over edge-swap variations of hypergraph product codes with an erasure-decoding cost function yields codes that beat Progressive Edge-Growth codes on erasure and bit-flip channels.
-
Enhanced Min-Sum Decoding of Quantum Codes Using Previous Iteration Dynamics
A min-sum variant that applies a past-influence update rule to one block of two-block CSS codes outperforms normalized min-sum and slightly beats BP-OSD-0 on bivariate bicycle codes.
-
SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry
SymBreak splits syndrome nodes during belief propagation, reporting 16x lower logical error rates than BP and 3.2x lower than BP+OSD for qLDPC codes, at near-BP runtime.
-
A Highly Accurate Fast Decoding Framework for QLDPC codes Accelerated by Noise Perturbation and Ensemble Decoding
Noise-perturbed ensembles of Tanner forests with exact tree inference match or beat BP+OSD0 accuracy while cutting per-round decoding time by orders of magnitude.
-
Multistage Rewinding Decoder for QLDPC Codes
A multistage rewinding decoder that forces suspicious qubit values in a beam search improves QLDPC decoding over normalized min-sum and approaches BP-OSD-10 performance.
Discussion (0). Continue with ORCID to comment.