Curator's Take
AI Commentary
This article shows that a whole family of high‑rate lifted‑product LDPC codes can be given a “canonical” logical basis that mirrors the tidy structure of hypergraph‑product codes, turning what was previously an unwieldy dense encoding into a platform for low‑overhead, constant‑depth Clifford gates and modular code‑surgery. By co‑designing the code with its instruction set, the authors demonstrate that even large‑scale examples (e.g., a [[4350,1224,…]] code) need only a handful of reusable surgery gadgets and support parallel magic‑state injection, dramatically shrinking the qubit budget for fault‑tolerant computation. This breakthrough bridges the gap between the theoretical promise of high‑rate qLDPC codes and practical, scalable quantum processors, moving the field closer to hardware‑efficient error correction beyond surface‑code paradigms.
— Mark Eatherly
Summary
High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such dense encodings remains a major challenge. Generic, code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes whose structure is left unexploited. Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of \emph{canonical} lifted-product (LP) codes with cyclic symmetry. We show that these codes admit a \emph{canonical logical basis}, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes, analogous to the structure that makes hypergraph-product codes so tractable. This canonical basis unlocks a complete logical instruction set, including constant-depth automorphism and fold-transversal Clifford gates, modular graph code surgeries built from a constant number of reusable seed surgery gadgets or a compact canonical extractor, highly parallel logical Pauli-product measurements, and parallel magic-state injection. For example, a $[[1122,148,\leq\!20]]$ (resp. $[[4350,1224,\leq\!20]]$) LP code requires only two (resp. four) seed surgery gadgets, while arbitrary high-weight logical measurements can be implemented using a full extractor smaller than half of the data code block. These results advance the frontier of fault-tolerant quantum computation on ultra-high-rate quantum architectures.