Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 5verdicts
UNVERDICTED 5representative citing papers
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.
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.
Introduces a gauging-based method for fault-tolerant logical measurement achieving qubit overhead linear in operator weight up to polylog factors, adaptable to arbitrary codes.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
-
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.
-
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.
-
Low-overhead fault-tolerant quantum computation by gauging logical operators
Introduces a gauging-based method for fault-tolerant logical measurement achieving qubit overhead linear in operator weight up to polylog factors, adaptable to arbitrary codes.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.