Translation-invariant quantum low-density parity-check codes from compactified fracton models

• URL: http://arxiv.org/abs/2605.19298v1
• Date: Tue, 19 May 2026 03:18:11 GMT
• Title: Translation-invariant quantum low-density parity-check codes from compactified fracton models
• Abstract summary: Quantum error-correcting codes with translation symmetry and local checks have been studied extensively.<n>We provide a unifying picture for a large family of translation-invariant codes, both local and long-range.<n>We conjecture that unifying the gates and barriers of the translation-invariant descendant codes are limited by those of their parent fracton models.
• Score: 12.040554116414398
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error-correcting codes with translation symmetry and local checks have been studied extensively, leading to a wide variety of fracton codes in three or more dimensions which lack a complete unifying picture. Recently, the study of translation-invariant codes with long-range checks has revealed impressive performance for small fixed-size instances in two dimensions. Here, we provide a unifying picture for a large family of translation-invariant codes, both local and long-range, that captures many fracton codes and all Abelian Two-Block Group Algebra (A2BGA) codes, including the Bivariate Bicycle (BB) codes. The balanced product structure of A2BGA codes leads to a local parent code that is a hypergraph product fracton model in a higher dimension. Different compactifications of a parent code produce a wide variety of descendant codes which provides a unifying picture for their properties. In particular, all BB codes with the same check weight are derived from a single parent hypergraph product fracton model. This construction allows us to extend Wang and Pryadko's code-parameter bounds for Generalized Bicycle codes to A2BGA codes. We conjecture that the transversal gates and energy barriers of the translation-invariant descendant codes are limited by those of their parent fracton models.

Related papers

• A Classification of Translation-Invariant Quantum Codes in Any Dimension [2.1533129029644793]
  We focus on D-dimensional translation-invariant quantum codes based on length-D chain complexes.<n>We show that such codes are equivalent to copies of D-dimensional toric codes.<n>This directly generalizes the classification result for two-dimensional translation-invariant codes.
  arXiv  Detail & Related papers  (2026-08-21T11:08:35Z)
• Coupled-Layer Codes: Beyond Quantum Product Constructions [0.664167116861767]
  Product codes are an important class of quantum error-correcting codes constructed from multiple input codes.<n>We show how coupled-layer codes reproduce the X-cube and Chamon models.<n>In particular, we show how balancing by a ZX-duality can reproduce non-CSS codes such as the fermionic toric code and the 3-fermion Walker-Wang model in 3D.
  arXiv  Detail & Related papers  (2026-08-10T18:00:01Z)
• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• 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)
• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry [48.254879700836376]
  We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces.<n>We prove that many codes and their gates in $SU(q)$ can be inter-converted between the three state spaces.<n>We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters.
  arXiv  Detail & Related papers  (2025-09-24T20:21:30Z)
• Moderate-length lifted quantum Tanner codes [11.310502327308578]
  We introduce new families of quantum Tanner codes, a class of quantum codes first appeared in the work of Leverrier and Z'emor.<n>We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and for which the distance surpasses the square root of the code length.
  arXiv  Detail & Related papers  (2025-02-27T17:23:53Z)
• Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions [1.6385815610837167]
  Quantum low-density parity-check codes are promising candidates for quantum error correcting codes.<n>We introduce the concept of pruning quantum codes.<n>We investigate fault-tolerant quantum computation using the constructed pruned codes by describing fold-transversal gates.
  arXiv  Detail & Related papers  (2024-12-05T14:20:44Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Towards Accurate Image Coding: Improved Autoregressive Image Generation with Dynamic Vector Quantization [73.52943587514386]
  Existing vector quantization (VQ) based autoregressive models follow a two-stage generation paradigm. We propose a novel two-stage framework: (1) Dynamic-Quantization VAE (DQ-VAE) which encodes image regions into variable-length codes based their information densities for accurate representation.
  arXiv  Detail & Related papers  (2023-05-19T14:56:05Z)
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models [44.99833362998488]
  Topological subsystem codes allow for quantum error correction with no time overhead, even in the presence of measurement noise. We provide a systematic construction of a class of codes in three dimensions built from abelian quantum double models in one fewer dimension. Our construction not only generalizes the recently introduced subsystem toric code, but also provides a new perspective on several aspects of the original model.
  arXiv  Detail & Related papers  (2023-05-10T18:00:01Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)

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.