Researchers have developed a method for performing fault-tolerant logical computation on high-rate quantum low-density parity-check (qLDPC) codes. These codes are promising for quantum computing because they allow encoding many logical qubits with a relatively low overhead of physical qubits. However, implementing efficient and certifiable logical operations on these dense encodings has been a significant challenge until now. The key to the advance lies in co-designing the code and its logical instruction set, exploiting the inherent structure of a family of canonical lifted-product (LP) codes with cyclic symmetry.

The team identified a "canonical logical basis" in these codes, where conjugate logical operators are organized into cyclic orbits, a feature analogous to what makes hypergraph-product codes manageable. This canonical basis enables a complete logical instruction set. This includes constant-depth Clifford gates, modular code surgeries built from a constant number of reusable seed gadgets, highly parallel logical Pauli-product measurements, and parallel magic-state injection. For instance, a [[1122,148,≤20]] type LP code requires only two surgery gadgets, while a [[4350,1224,≤20]] code needs four.

These capabilities are achieved using a compact canonical extractor, which is smaller than half of the data code block for arbitrary high-weight logical measurements. This approach overcomes the limitations of generic techniques, which are often difficult to modularize and certify on complex, high-rate codes. The results obtained represent a significant step towards fault-tolerant quantum computation on ultra-high-rate quantum architectures, opening new avenues for the development of more robust and scalable quantum computers.