Quantum two-block group algebra codes

• URL: http://arxiv.org/abs/2306.16400v1
• Date: Wed, 28 Jun 2023 17:50:33 GMT
• Title: Quantum two-block group algebra codes
• Authors: Hsiang-Ku Lin and Leonid P. Pryadko
• Abstract summary: 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.
• Score: 0.5076419064097732
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary finite group, generally non-abelian. 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. We establish criteria for permutation equivalence of 2BGA codes and give bounds for their parameters, both explicit and in relation to other quantum and classical codes. We also enumerate the optimal parameters of all inequivalent connected 2BGA codes with stabilizer generator weights $W \le 8$, of length $n \le 100$ for abelian groups, and $n \le 200$ for non-abelian groups.

Related papers

• Classical and quantum Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the Reed-Muller family by replacing the group $mathbbZm$ with an arbitrary finite Coxeter group. We also construct quantum CSS codes arising from the Coxeter codes, which admit logical operators outside of the Clifford group.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions [1.6385815610837167]
  Quantum low-density parity-check codes are promising candidates for quantum error correcting codes. We introduce the concept of pruning quantum codes. We investigate fault-tolerant quantum computation using the constructed pruned codes by describing fold-transversal gates.
  arXiv  Detail & Related papers  (2024-12-05T14:20:44Z)
• 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)
• Unifying error-correcting code/Narain CFT correspondences via lattices over integers of cyclotomic fields [0.0]
  We identify Narain conformal field theories that correspond to code lattices for quantum error-correcting codes (QECC) over integers of cyclotomic fields $Q(zeta_p)$ $(zeta_p=efrac2pi ip)$ for general prime $pgeq 3$. This code-lattice construction is a generalization of more familiar ones such as Construction A$_C$ for ternary codes and (after the generalization stated below) Construction A for binary codes, containing them as special cases.
  arXiv  Detail & Related papers  (2024-10-16T12:08:04Z)
• 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)
• Quantum Margulis Codes [3.3148826359547514]
  Recently, Lin and Pryadko presented the quantum two-block group algebra codes. We show how to modify the construction of Margulis to get a two-block algebra code.
  arXiv  Detail & Related papers  (2024-09-15T19:08:34Z)
• 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)
• 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. The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
  arXiv  Detail & Related papers  (2023-12-18T13:18:19Z)
• 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)
• 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. 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)
• 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)

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.