Fault-Tolerant Belief Propagation for Practical Quantum Memory

TL;DR

This paper introduces a fault-tolerant belief propagation decoder for quantum error correction that improves decoding speed and accuracy, enabling more reliable quantum memory with high error thresholds.

Contribution

It presents a novel FTBP decoder using a space-time Tanner graph, probabilistic error consolidation, and an adaptive sliding window for improved quantum error correction.

Findings

Achieves high error thresholds of 0.4%-0.87% for various topological codes.

Demonstrates strong error-floor performance.

Enhances decoding efficiency for quantum low-density parity-check codes.

Abstract

A fault-tolerant approach to reliable quantum memory is essential for scalable quantum computing, as physical qubits are susceptible to noise. Quantum error correction (QEC) must be continuously performed to prolong the memory lifetime. In QEC, error syndromes are generated rapidly, often within the execution time of a few quantum gates, requiring decoders to process this error data with equal speed. A typical QEC cycle involves multiple rounds of syndrome measurements, causing potential error locations to scale rapidly with the code size and the number of measurement rounds. However, no such decoders currently exist for general quantum low-density parity-check codes. In this paper, we propose a fault-tolerant belief propagation (FTBP) decoder that utilizes a space-time Tanner graph across multiple rounds of syndrome extraction with mixed-alphabet error variables. To enhance FTBP, we introduce a technique of probabilistic error consolidation to mitigate degeneracy effects and short cycles. Additionally, we propose an adaptive sliding window procedure that captures long error events across window boundaries and adjusts the decoding in real time. Our simulations demonstrate high error thresholds of 0.4%-0.87% and strong error-floor performance for topological code families, including rotated toric, toric color, and twisted XZZX toric codes.