Quantum codes sidestep a key limit on error correction

Kenta Kasai has demonstrated a new approach to building quantum low-density parity-check codes that circumvents a longstanding structural limitation. While classical LDPC codes underpin modern data storage and communication, directly applying their design to quantum computing requires additional constraints on parity-check matrices. Researchers overcame this hurdle by utilizing permutation matrices with controlled commutativity and restricting orthogonality constraints to only the active part of the code construction. This design enables the creation of quantum LDPC codes with large girth while avoiding latent low-weight logical operators, and as a demonstration, a girth-8, (3,12)-regular [[9216,4612, ≤ 48]] code achieved a frame error rate as low as 10-8.

Controlled Commutativity Overcomes Orthogonality Limits This performance stems from a design that circumvents limitations previously imposed by the need for orthogonal parity-check matrices, a challenge unique to quantum systems compared to their classical counterparts. This approach preserves regular check-matrix structures, which are important for efficient decoding, while simultaneously avoiding structural distance limitations that typically arise from parent-matrix orthogonality. The result is a code with a large girth, a measure of the shortest cycle in the code’s graph, and, critically, avoids latent low-weight logical operators that can compromise error correction. As a concrete demonstration of this new methodology, researchers constructed a girth-8, (3,12)-regular [[9216,4612, ≤ 48]] quantum LDPC code. This specific code configuration represents a step toward practical quantum communication and computation. “This provides a route for bringing mature classical LDPC design methods into high-rate quantum error correction,” the study reports, highlighting the potential for using decades of classical coding theory to accelerate progress in the quantum realm. The ability to create quantum LDPC codes with both large girth and the avoidance of low-weight logical operators was previously considered a difficult trade-off, now overcome through this innovative design. Girth-8, (3,12)-Regular Quantum LDPC Code Construction Maintaining regular check-matrix structures in quantum low-density parity-check (LDPC) codes typically compromises either code girth or minimum distance; however, a newly constructed code demonstrates both a large girth and avoidance of problematic logical operators. This performance indicates a potential way to apply established classical LDPC design techniques within high-rate quantum error correction schemes. The key to this advancement lies in a novel approach to managing orthogonality constraints inherent in quantum parity checks. The result is a code that retains a regular sparse structure critical for efficient decoding while simultaneously maximizing girth and minimizing the risk of low-weight logical operators. Classical LDPC codes, foundational to modern communication systems, present challenges when adapted for quantum error correction due to the added requirement of commutation between quantum parity checks. “Classical LDPC codes are central to modern communications, but their design principles are difficult to transfer to quantum error correction because quantum parity checks must satisfy an additional commutation constraint,” the study notes. By selectively applying this commutation constraint only to the active portion of the code, the team successfully bridged the gap between classical design principles and the demands of quantum computation. Source: https://quantum-journal.org/papers/q-2026-09-09-2205/ More like thisQuantum Research NewsQuantum Error Correction: Efficient LDPC Code SamplingQuantum AlgorithmsOkada and Colleagues Develop Rate-2/3 Quantum LDPC Code for Enhanced Error CorrectionQuantum AlgorithmsSuperconducting Processors: 50% Wiring ReductionQuantum Research NewsFPGA Decodes Quantum LDPC Codes in Real-TimeStay currentSee today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals. Tags: Dr. Donovan Dr. Donovan is a futurist and technology writer covering the quantum revolution. Where classical computers manipulate bits that are either on or off, quantum machines exploit superposition and entanglement to process information in ways that classical physics cannot. Dr. Donovan tracks the full quantum landscape: fault-tolerant computing, photonic and superconducting architectures, post-quantum cryptography, and the geopolitical race between nations and corporations to achieve quantum advantage. The decisions being made now, in research labs and government offices around the world, will determine who controls the most powerful computers ever built. Latest Posts by Dr.