Lifting Lifted Product Codes

• URL: http://arxiv.org/abs/2607.28621v1
• Date: Thu, 30 Jul 2026 17:59:18 GMT
• Title: Lifting Lifted Product Codes
• Abstract summary: We introduce a systematic construction of LP code families based on group extensions and graph lifts.<n>The construction increases the code size while preserving the local structure of the Tanner graph.<n>As a first application, we obtain LP codes with better code parameters than previously reported ones.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lifted product (LP) codes form an important class of quantum error correcting codes with favorable code parameters. We introduce a systematic construction of LP code families based on group extensions and graph lifts. The construction increases the code size while preserving the local structure of the Tanner graph, and relates code parameters, logical operators, and fault-tolerant logical-operation gadgets within the families through chain and cochain maps. As a first application, we obtain LP codes with better code parameters than previously reported ones. We then demonstrate that code-surgery gadgets can be transferred across the selected finite lifts through chain maps and, in several cases, implemented with lower space overhead. We also develop parallel product surgery for lifted clustered cyclic codes. Finally, we propose lifting as a systematic first step toward defining thermodynamic families for algebraically defined qLDPC codes without an underlying Euclidean lattice. For several base codes and selected lifts, coherent information exhibits finite-size crossings, while our results also indicate that additional conditions are needed to determine a unique family.

Related papers

• Logical computation with canonical lifted product codes [3.653555716265332]
  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.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
  arXiv  Detail & Related papers  (2026-07-30T17:55:34Z)
• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• Theory of (Co)homological Invariants on Quantum LDPC Codes [10.357450788005307]
  We study (co)homological invariants of quantum code complexes, which fundamentally underlie their logical operations.<n>We generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting.<n>We present the first comprehensive computation of cup products within the intricate framework of sheaf codes.
  arXiv  Detail & Related papers  (2026-03-26T18:50:36Z)
• Coupled-Layer Construction of Quantum Product Codes [0.664167116861767]
  Product codes are quantum error correcting codes built from two or more constituent codes.<n>We show that the tensor and balanced product codes admit an intuitive coupled-layer construction by taking a stack of one code and condensing a set of excitations in the pattern given by the checks of the other code.
  arXiv  Detail & Related papers  (2026-03-09T17:59:59Z)
• Quantum bootstrap product codes [8.649956206461296]
  Product constructions constitute a powerful method for generating quantum CSS codes.<n>We introduce the textitquantum bootstrap productfork (QBP)<n>We show that QBP can generate self-correcting quantum codes from input codes with constant energy barriers.
  arXiv  Detail & Related papers  (2026-01-29T22:16:31Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
  We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Lifts of quantum CSS codes [0.0]
  We propose a notion of lift for quantum CSS codes, inspired by the geometrical construction of Freedman and Hastings. It is based on the existence of a canonical complex associated to any CSS code, that we introduce under the name of Tanner cone-complex.
  arXiv  Detail & Related papers  (2024-04-25T16:44:45Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.