Algebraic structure of Tiger codes

• URL: http://arxiv.org/abs/2607.22460v1
• Date: Fri, 24 Jul 2026 16:23:36 GMT
• Title: Algebraic structure of Tiger codes
• Abstract summary: Tiger codes form a family of multimode bosonic quantum codes that unify several previously known constructions.<n>We show that the logical structure of the code is governed by the homology of an underlying chain complex.<n>We extend the framework to non-linear number constraints, including codes such as the four-legged cat or the repetition cat code.
• Score: 2.8292841621378844
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tiger codes form a family of multimode bosonic quantum codes that unify several previously known constructions, including cat, paircat, and the two-mode binomial code. In this work, we give a rigorous algebraic treatment of these codes. Starting from a kernel definition of the codespace, we prove that the annihilation-type constraints admit a finite generating set, construct an explicit orthonormal basis, and show that the logical structure of the code is governed by the homology of an underlying chain complex, as expected in the original work on Tiger codes of Xu et al. We then develop a Fourier transform over the codespace to prove that the span of phase-rotated projected coherent states is dense therein, and to yield dual $X$- and $Z$-type descriptions of the code. We further extend the framework to non-linear number constraints, encompassing codes such as the four-legged cat or the repetition cat code. Finally, we investigate the implementation of logical operations. We first generalise the construction of logical Pauli operators proposed by Xu et al. to arbitrary logical spaces, and then construct non-Clifford gates using physical polynomial phase rotations of the form $e^{iP(\hat{\boldsymbol{n}})}$. We derive criteria on the real polynomial $P$ which, for positive single-logical-qubit Tiger codes satisfying an additional sign assumption, such as the paircat code, characterise the polynomials $P$ that preserve the codespace by decomposing them into a family of univariate polynomials. Through this decomposition, we relate the degrees of the resulting components to the induced logical action in the Clifford hierarchy. These results establish Tiger codes as a mathematically robust framework for describing a broad class of bosonic encodings.

Related papers

• 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)
• Poincaré Duality and Multiplicative Structures on Quantum Codes [11.11194917284133]
  We build circuits composed of $mathrmCmathrmCZ$ gates as well as for higher order controlled-$Z$ gates.<n>We conjecture that they generate nontrivial logical actions, pointing towards fault-tolerant non-Clifford gates on nearly optimal qLDPC sheaf codes.
  arXiv  Detail & Related papers  (2025-12-26T08:38:08Z)
• The Tangent Space Attack [0.0]
  We propose a new method for retrieving the structure of a generic alternant code given an arbitrary generator matrix.<n>We then discuss how this challenges the security of the McEliece cryptosystem instantiated with this family of codes.
  arXiv  Detail & Related papers  (2025-05-15T11:30:46Z)
• 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)
• Letting the tiger out of its cage: bosonic coding without concatenation [3.5833783802192998]
  Cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation.<n>We construct multimode codes with similar linear constraints using any two integer matrices satisfying a CSS-like homological condition of a quantum rotor code.<n>Just like the pair-cat code, syndrome extraction can be performed in tandem with stabilizing dissipation using current superconducting-circuit designs.
  arXiv  Detail & Related papers  (2024-11-14T18:38:33Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Extracting topological orders of generalized Pauli stabilizer codes in two dimensions [5.593891873998947]
  We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems.<n>The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
  arXiv  Detail & Related papers  (2023-12-18T13:18:19Z)
• 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)
• 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)
• 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.