Copy-cup Gates in Tensor Products of Group Algebra Codes

• URL: http://arxiv.org/abs/2602.23307v1
• Date: Thu, 26 Feb 2026 18:11:10 GMT
• Title: Copy-cup Gates in Tensor Products of Group Algebra Codes
• Authors: Ryan Tiew, Nikolas P. Breuckmann,
• Abstract summary: We determine conditions on classical group algebra codes so that they have pre-orientation for cup products and copy-cup gates.<n>We show that determining the conditions relies on solving the perfect matching problem in graph theory.<n>We find examples of quantum codes from the product of abelian group algebra codes that have constant-depth $operatornameCZ$ and $operatornameCCZ$ gates.
• Score: 7.734726150561087
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We determine conditions on classical group algebra codes so that they have pre-orientation for cup products and copy-cup gates. This defines quantum codes that have constant-depth $\operatorname{CZ}$ and $\operatorname{CCZ}$ gates constructed via tensor products of classical group algebra codes, including hypergraph and balanced products. We show that determining the conditions relies on solving the perfect matching problem in graph theory. Conditions are fully determined for the 2- and 3-copy-cup gates, for group algebra codes up to weight 4, including for codes with odd check weight. These include the bivariate bicycle codes, which we show do not have the pre-orientation for either type of copy-cup gate. We show that abelian weight 4 group algebra codes satisfying the non-associative 3-copy-cup gate necessarily have a code distance of 2, whereas codes that satisfy conditions for the symmetric 3-copy-cup gate can have higher distances, and in fact also satisfy conditions for the 2-copy-cup gate. Finally we find examples of quantum codes from the product of abelian group algebra codes that have inter-code constant-depth $\operatorname{CZ}$ and $\operatorname{CCZ}$ gates.

Related papers

• Calderbank-Shor-Steane codes on group-valued qudits [1.744249132777104]
  Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting $X$- and $Z$-type checks.<n>We introduce CSS-like codes on $G$-valued qudits for any finite group $G$ that reduce to qubit CSS codes for $G = mathbbZ$ yet generalize the Kitaev quantum double model for general groups.
  arXiv  Detail & Related papers  (2026-02-23T07:08:00Z)
• 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)
• 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)
• 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)
• Cups and Gates I: Cohomology invariants and logical quantum operations [5.749787074942512]
  We show how to equip quantum codes with a structure that relaxes certain properties of a differential graded algebra. The logical gates obtained from this approach can be implemented by a constant-depth unitary circuit.
  arXiv  Detail & Related papers  (2024-10-21T17:53:17Z)
• 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)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Quantum two-block group algebra codes [0.5076419064097732]
  We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. As special cases, 2BGA codes include a subset of square-matrix LP codes over abelian groups, including quasi-cyclic codes, and all square-matrix hypergraph-product codes constructed from a pair of classical group codes.
  arXiv  Detail & Related papers  (2023-06-28T17:50:33Z)
• Abelian and non-abelian quantum two-block codes [0.5658568324275767]
  Two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group. We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.
  arXiv  Detail & Related papers  (2023-05-11T15:28:02Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)

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.