Presents planar open-boundary quantum LDPC codes with nearest-neighbor iSWAP-based syndrome extraction that outperform rotated surface codes in code-efficiency and logical error rate on finite instances like [[323,14,15]].
Au- tomorphism ensemble decoding of quantum LDPC codes
6 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
6
Pith papers citing it
2
external citations · external index
citation-role summary
background 1
baseline 1
citation-polarity summary
years
2026 6representative citing papers
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
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.
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.
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.
A resource-reusing FPGA architecture for GARI-structured message-passing decoding of quantum LDPC codes with correlated errors achieves 596 ns average latency and 6x lower resource use than prior GARI hardware on a VCU19P device.
citing papers explorer
-
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
Presents planar open-boundary quantum LDPC codes with nearest-neighbor iSWAP-based syndrome extraction that outperform rotated surface codes in code-efficiency and logical error rate on finite instances like [[323,14,15]].
-
Approximating optimal decoding of quantum LDPC codes with narrow frontiers
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
-
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 BP convergence and reduces logical error rates on toric and generalized bicycle codes.
-
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.
-
A Scalable FPGA Architecture for Real-Time Decoding of Quantum LDPC Codes Using GARI
A resource-reusing FPGA architecture for GARI-structured message-passing decoding of quantum LDPC codes with correlated errors achieves 596 ns average latency and 6x lower resource use than prior GARI hardware on a VCU19P device.