Logical Operators and Derived Automorphisms of Tile Codes

• URL: http://arxiv.org/abs/2511.14589v1
• Date: Tue, 18 Nov 2025 15:32:48 GMT
• Title: Logical Operators and Derived Automorphisms of Tile Codes
• Authors: Nikolas P. Breuckmann, Shin Ho Choe, Jens Niklas Eberhardt, Francisco Revson Fernandes Pereira, Vincent Steffan,
• Abstract summary: 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.
• Score: 9.420795715422711
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The recently introduced tile codes are a promising alternative to surface codes, combining two-dimensional locality with higher encoding efficiency. While surface codes are well understood in terms of their logical operators and boundary behavior, much less is known about tile codes. In this work, we establish a natural and precise description of their logical operator space. We prove that, under mild assumptions, any tile code admits a canonical symplectic basis of logical operators supported along lattice boundaries, which can be generated efficiently by a simple cellular automaton with the number of update rules only depending on the non-locality of the tile code. Further, we develop algebraic and algebro-geometric frameworks for tile codes, by resolving them by translationally invariant Pauli stabilizer models and showing that they arise as derived sections of a Koszul complex on $\mathbb{P}^1 \times \mathbb{P}^1$. Finally, we introduce the concept of derived automorphisms for quantum codes. These are automorphism-like operations that can exist even for codes that do not have symmetries. We explain how derived automorphisms can be implemented for tile codes in a low-overhead and fault-tolerant manner by extending the lattice on one side and shrinking it on the other. While this operation is trivial for the surface code, it induces a product of logical CNOT gates on the encoded information. Our results provide new structural insights into tile codes and lay the groundwork for tile codes as building blocks for fault-tolerant quantum computation.

Related papers

• 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)
• Automorphism gadgets in homological product codes [0.0]
  We investigate structured homological product codes that admit logical operations arising from permutation symmetries in their input codes.<n>In general, these logical operations can be performed by a combination of physical qubit permutations and a subsystem circuit.<n>Our results further advance the search for practical fault tolerance beyond topological codes in platforms capable of long-range connectivity.
  arXiv  Detail & Related papers  (2025-08-06T18:10:37Z)
• 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)
• 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)
• 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)
• Comments as Natural Logic Pivots: Improve Code Generation via Comment Perspective [85.48043537327258]
  We propose MANGO (comMents As Natural loGic pivOts), including a comment contrastive training strategy and a corresponding logical comment decoding strategy. Results indicate that MANGO significantly improves the code pass rate based on the strong baselines. The robustness of the logical comment decoding strategy is notably higher than the Chain-of-thoughts prompting.
  arXiv  Detail & Related papers  (2024-04-11T08:30:46Z)
• 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)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Contrastive Learning for Source Code with Structural and Functional Properties [66.10710134948478]
  We present BOOST, a novel self-supervised model to focus pre-training based on the characteristics of source code. We employ automated, structure-guided code transformation algorithms that generate functionally equivalent code that looks drastically different from the original one. We train our model in a way that brings the functionally equivalent code closer and distinct code further through a contrastive learning objective.
  arXiv  Detail & Related papers  (2021-10-08T02:56:43Z)

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.