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.
An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3representative citing papers
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
FPGA emulator tests 10^13 error patterns in 20 days and diversity BP decoder matches BP+OSD logical error rates with 30-80% average speed gains and far less post-processing for QLDPC codes.
citing papers explorer
-
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.
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation
FPGA emulator tests 10^13 error patterns in 20 days and diversity BP decoder matches BP+OSD logical error rates with 30-80% average speed gains and far less post-processing for QLDPC codes.