Quantum Low-Density Parity-Check Codes

2025-10-15

AI Summary

Current quantum low-density parity-check (QLDPC) codes struggle to simultaneously satisfy hardware constraints and achieve strong finite-length error-correction performance. Method: This paper introduces a novel family of sparse stabilizer codes that break the conventional √n distance barrier, enabling fault tolerance under constant encoding overhead; designs a belief-propagation-based iterative decoder explicitly incorporating hardware constraints—including qubit connectivity, native gate sets, and realistic noise models; and jointly optimizes quantum channel modeling and fault-tolerant protocols to approach the quantum channel capacity while maintaining low overhead. Contribution/Results: Experimental evaluation demonstrates substantial improvements in finite-length error thresholds and logical error-rate suppression. The proposed framework provides a practical, scalable pathway toward large-scale, hardware-efficient fault-tolerant quantum computation.

Technology Category

• Machine Learning: Quantum Machine Learning
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Learning to Search

Application Category

• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: LLM based quality controls for crowd work
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics

Abstract

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes -- have risen to the forefront of QEC research in recent years. This can be attributed to several key factors. First, classical LDPC codes admit low-complexity belief propagation iterative decoding and near-capacity performance, which contributed to the early interest in QLDPC codes. Then, the result promising constant overhead fault tolerance using QLDPC codes led to the search for code families that go beyond the long-holding $sqrt{n}$ scaling barrier of minimum distance for codelength $n$. This resulted in recent breakthroughs in the construction of QLDPC codes, which, combined with efficient decoding algorithms and the development of fault-tolerant protocols operating on QLDPC-encoded quantum information, provide a promising pathway to low-overhead, fault-tolerant quantum computation. However, despite their potential, challenges remain, particularly in constructing and decoding finite-length codes that account for, or efficiently leverage, specific characteristics of quantum hardware, such as connectivity, topology, native gate sets, and noise models. This article provides an in-depth examination of QLDPC codes and their iterative decoders, catering to an information theory audience with no or limited background in quantum mechanics. We discuss the theoretical underpinnings, explore unique characteristics of quantum channels, and delineate key code constructions and decoding algorithms, ultimately highlighting the impact and future prospects of QLDPC codes in quantum information science.

Problem

• Developing fault-tolerant quantum computation with low overhead
• Overcoming the minimum distance scaling barrier in QLDPC codes
• Addressing hardware-specific challenges in quantum error correction

Innovation

• QLDPC codes enable fault-tolerant quantum computation
• Iterative belief propagation decoding ensures efficient performance
• Hardware-aware code construction addresses quantum-specific challenges