Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
arXiv:2310.15000 · doi:10.22331/q-2024-05-02-1334
Abstract
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap between algorithmic solutions and hardware limitations, we introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. The proposed post-processing, referred to as check-agnosia, is inspired by stabilizer-inactivation, while considerably reducing the required hardware resources, and providing enough flexibility to allow different message-passing schedules and hardware architectures. We carry out a detailed analysis for a set of Pareto architectures with different tradeoffs between latency and power consumption, derived from the results of implemented designs on an FPGA board. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations. In the process, we also demonstrate the practical implications of the recently introduced t-covering layers and random-order layered scheduling.
References in corpus (8)
- The Future of Quantum Computing with Superconducting Qubits
- Quantum Low-Density Parity-Check Codes
- Decoding Across the Quantum LDPC Code Landscape
- Balanced Product Quantum Codes
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Deep neural decoders for near term fault-tolerant experiments
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Neural Network Decoders for Large-Distance 2D Toric Codes