Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

• URL: http://arxiv.org/abs/2606.05044v1
• Date: Wed, 03 Jun 2026 16:05:40 GMT
• Title: Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure
• Abstract summary: We develop a framework for analyzing and engineering automorphisms in Generalized Bicycle (GB) codes.<n>We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of $H CX-, $S$-, and $ CX$-type fold-transversal gates.<n>This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the $\mathbb{F}_2^{2\ell}$ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of $R_\ell^2$, where $R_\ell \cong \mathbb{F}_2[x]/\langle x^\ell-1\rangle$, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of $H$-, $S$-, and $CX$-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of $k=2$ MCR codes up to $d=13$ generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and $k>2$ MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.

Related papers

• Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus [37.09090127609627]
  We use the ZX-calculus language to handle dynamical stabilizer codes.<n>We combine gauge-fixing steps to implement a closed loop in the space of stabilizer codes.<n>This yields a machine-interpretable method for constructing dynamical automorphisms.
  arXiv  Detail & Related papers  (2026-06-01T17:46:09Z)
• Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators [36.94429692322632]
  Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings.<n>We compare the non-Clifford cost of implementing diagonal evolutions, exemplified by $U=e-it_x2$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=eil log drceil$ logical qubits.
  arXiv  Detail & Related papers  (2026-04-29T15:25:08Z)
• Qudit stabiliser codes for $\mathbb{Z}_N$ lattice gauge theories with matter [42.418429168532406]
  We show that a $mathbbZ_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit stabilizer code.<n>Using the stabilizer formalism we show how to formulate an exact mapping of the encoded $mathbbZ_N$ gauge theory onto two different bosonic models.
  arXiv  Detail & Related papers  (2026-02-24T08:07:05Z)
• Logical Operators and Derived Automorphisms of Tile Codes [9.420795715422711]
  tile codes are a promising alternative to surface codes.<n>In this work, we establish a natural and precise description of their logical operator space.<n> derived automorphisms can be implemented for tile codes in a low-overhead and fault-tolerant manner.
  arXiv  Detail & Related papers  (2025-11-18T15:32:48Z)
• 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)
• Generating logical magic states with the aid of non-Abelian topological order [0.0]
  In fault-tolerant quantum computing, non-Clifford gates are crucial for universal computation.<n>We propose a new protocol that combines magic state preparation and code transformation to realize logical non-Clifford operations.
  arXiv  Detail & Related papers  (2025-02-03T02:38:32Z)
• 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)
• Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
  We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes.<n>We present a formalism for addressable and parallel logical gates in LDPC codes viasymmetries.<n>As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
  arXiv  Detail & Related papers  (2024-11-24T14:01:37Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Fault-Tolerant Logical Clifford Gates from Code Automorphisms [2.7262923206583136]
  We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries.<n>Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted.
  arXiv  Detail & Related papers  (2024-09-26T18:00:00Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Adiabatic paths of Hamiltonians, symmetries of topological order, and automorphism codes [0.0]
  "Honeycomb code" is a fault-tolerant quantum memory defined by a sequence of checks. We argue that a general framework to understand this code is to consider continuous adiabatic paths of gapped Hamiltonians. We turn this path back into a sequence of checks, constructing an automorphism code closely related to the honeycomb code.
  arXiv  Detail & Related papers  (2022-03-21T17:12:31Z)

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.