Automorphism gadgets in homological product codes

• URL: http://arxiv.org/abs/2508.04794v1
• Date: Wed, 06 Aug 2025 18:10:37 GMT
• Title: Automorphism gadgets in homological product codes
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The homological product is a general-purpose recipe that forges new quantum codes from arbitrary classical or quantum input codes, often providing enhanced error-correcting properties. When the input codes are classical linear codes, it is also known as the hypergraph product. We investigate structured homological product codes that admit logical operations arising from permutation symmetries in their input codes. We present a broad theoretical framework that characterizes the logical operations resulting from these underlying automorphisms. In general, these logical operations can be performed by a combination of physical qubit permutations and a subsystem circuit. In special cases related to symmetries of the input Tanner graphs, logical operations can be performed solely through qubit permutations. We further demonstrate that these "automorphism gadgets" can possess inherent fault-tolerant properties such as effective distance preservation, assuming physical permutations are free. Finally, we survey the literature of classical linear codes with rich automorphism structures and show how various classical code families fit into our framework. Complementary to other fault-tolerant gadgets for homological product codes, our results further advance the search for practical fault tolerance beyond topological codes in platforms capable of long-range connectivity.

Related papers

• Logical computation with canonical lifted product codes [3.653555716265332]
  Code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
  arXiv  Detail & Related papers  (2026-07-30T17:55:34Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• 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)
• Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction [0.0]
  We show that logical gates can be expressed as exponential qubits of the electric and magnetic gauge fields.<n>Our results offer new insights into the interplay between quantum error correction, topology, and quantum field theory.
  arXiv  Detail & Related papers  (2025-11-19T08:23:50Z)
• Constant-Overhead Addressable Gates via Single-Shot Code Switching [1.6822770693792826]
  It is a major challenge to perform addressable and parallel logical operations on constantrate quantum LDPC (qLDPC) codes.<n>We introduce fault-tolerant protocols for performing various addressable gadgets as well as parallel logical operations with constant space-time overhead.
  arXiv  Detail & Related papers  (2025-10-08T08:37:50Z)
• No-go theorems for logical gates on product quantum codes [5.529881798520845]
  Homological products of codes offer a versatile framework for quantum error-correcting codes.<n>We show that non-Clifford logical gates cannot be implemented accessiblely on hypergraph product codes.
  arXiv  Detail & Related papers  (2025-07-22T17:46:45Z)
• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  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)
• Dynamically generated concatenated codes and their phase diagrams [0.0]
  We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry. In the presence of bulk errors, the coding phase is a type of spin glass, characterized by a distribution of failure probabilities.
  arXiv  Detail & Related papers  (2024-09-20T17:51:50Z)
• 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)
• Partitioning qubits in hypergraph product codes to implement logical gates [0.0]
  Transversal gates are the simplest type of fault-tolerant logical gates. We show that gates can be used as the basis for universal quantum computing on LDPC codes.
  arXiv  Detail & Related papers  (2022-04-22T16:45:19Z)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• 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)
• 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)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)

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.