Quantum low-density parity-check (QLDPC) codes offer lower overhead than topological quantum error-correcting codes, but decoding remains a key challenge for scalable fault-tolerant quantum computing. This work introduces a highly parallelizable decoding algorithm for QLDPC codes that matches the accuracy of leading decoders while enabling significantly improved scalability.
- Timo Hillmann
- Lucas Berent
- Joschka Roffe