Abelian and non-abelian quantum two-block codes
- URL: http://arxiv.org/abs/2305.06890v2
- Date: Mon, 31 Jul 2023 00:45:52 GMT
- Title: Abelian and non-abelian quantum two-block codes
- Authors: Renyu Wang, Hsiang-Ku Lin, and Leonid P. Pryadko
- Abstract summary: 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.
- Score: 0.5658568324275767
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We discuss quantum two-block codes, a large class of CSS codes constructed
from two commuting square matrices.Interesting families of such codes are
generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where
a cyclic group is replaced with an arbitrary finite group, generally
non-abelian. We present code construction and give several expressions for code
dimension, applicable depending on whether the constituent group is cyclic,
abelian, or 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.
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) - 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) - Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach [2.3940819037450987]
We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT)
We also consider repeated-root constacyclic codes and characterize them in terms of symmetric and asymmetric $q$-cyclotomic cosets.
quantum encoders and decoders are also proposed in the transform domain for Calderbank-Shor-Steane CSS-based quantum codes.
arXiv Detail & Related papers (2024-07-23T19:48:12Z) - 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) - 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) - Quantum spherical codes [55.33545082776197]
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes.
We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
arXiv Detail & Related papers (2023-02-22T19:00:11Z) - Pauli topological subsystem codes from Abelian anyon theories [2.410842777583321]
We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories.
Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits.
arXiv Detail & Related papers (2022-11-07T19:00:01Z) - 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.