Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
arXiv preprint arXiv:1310.0863 , year=
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
representative citing papers
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
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.
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly with each primitive and decoder.
Adaptive-window decoding that shrinks or expands based on decoder confidence cuts reaction-time overhead in quantum error correction without raising logical error rates.
citing papers explorer
-
Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
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.
-
Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
-
FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models
FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly with each primitive and decoder.
-
ADaPT: Adaptive-window Decoding for Practical fault-Tolerance
Adaptive-window decoding that shrinks or expands based on decoder confidence cuts reaction-time overhead in quantum error correction without raising logical error rates.