A Classification of Translation-Invariant Quantum Codes in Any Dimension

• URL: http://arxiv.org/abs/2608.20981v1
• Date: Fri, 21 Aug 2026 11:08:35 GMT
• Title: A Classification of Translation-Invariant Quantum Codes in Any Dimension
• Abstract summary: 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.
• Score: 2.1533129029644793
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error-correcting codes with two-dimensional translation invariance are known to be equivalent to copies of the two-dimensional toric code. Such a simple classification is not possible for quantum codes with higher dimensional translation invariance due to the existence of multiple types of toric codes and infinite families of fracton codes. Here, we focus on D-dimensional translation-invariant quantum codes based on length-D chain complexes. This includes multivariate multicycle codes where the number of variables equals the number of cycles. We show that such codes are equivalent to copies of D-dimensional toric codes. This directly generalizes the classification result for two-dimensional translation-invariant codes.

Related papers

• Translation-invariant quantum low-density parity-check codes from compactified fracton models [12.040554116414398]
  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.
  arXiv  Detail & Related papers  (2026-05-19T03:18:11Z)
• 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 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)
• 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)
• Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes [2.2657086779504017]
  We introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes. We present new $n$-dimensional toric quantum codes, where $ngeq 5$ are featured by lattice codes. We derive new $n$-dimensional quantum burst-error-correcting codes.
  arXiv  Detail & Related papers  (2024-10-26T17:29:20Z)
• Quotient Space Quantum Codes [0.0]
  In this paper, I establish the quotient space codes to construct quantum codes. These new codes unify additive codes and codeword stabilized codes and can transmit classical codewords. I also present new bounds for quantum codes and provide a simple proof of the quantum Singleton bound.
  arXiv  Detail & Related papers  (2023-11-13T12:03:59Z)
• Spatially-Coupled QLDPC Codes [3.1000291317724997]
  We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes.<n>We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes.<n>This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
  arXiv  Detail & Related papers  (2023-04-29T00:57:57Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• 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)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Grand Unification of continuous-variable codes [0.0]
  Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have been identified to be a technologically viable option for building fault-tolerant quantum computers. Best-known examples are the GKP code and the cat-code, both of which were shown to have some advantageous properties over any discrete-variable, or qubit codes. It was recently shown that the cat-code, as well as other kinds of CV codes, belong to a set of codes with common properties called rotation-symmetric codes.
  arXiv  Detail & Related papers  (2022-06-03T18:00:01Z)
• 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.