Coxeter codes: Extending the Reed-Muller family
- URL: http://arxiv.org/abs/2502.14746v2
- Date: Wed, 11 Jun 2025 03:40:56 GMT
- Title: Coxeter codes: Extending the Reed-Muller family
- Authors: Nolan J. Coble, Alexander Barg,
- Abstract summary: 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.
- Score: 59.90381090395222
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Binary Reed-Muller (RM) codes are defined via evaluations of Boolean-valued functions on $\mathbb{Z}_2^m$. We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $\mathbb{Z}_2^m$ with an arbitrary finite Coxeter group. Like RM codes, this class is closed under duality, forms a nested code sequence, satisfies a multiplication property, and has asymptotic rate determined by a Gaussian distribution. Coxeter codes also give rise to a family of quantum codes for which transversal diagonal $Z$ rotations can perform non-trivial logic.
Related papers
- Optimal Quantum $(r,δ)$-Locally Repairable Codes From Matrix-Product Codes [52.3857155901121]
We study optimal quantum $(r,delta)$-LRCs from matrix-product (MP) codes.<n>We present five infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
arXiv Detail & Related papers (2025-08-05T16:05:14Z) - A Note on Clifford Stabilizer Codes for Ising Anyons [0.0]
We provide a streamlined elaboration on existing ideas that link Ising anyon (or equivalently, Majorana) stabilizer codes to certain classes of binary classical codes.
arXiv Detail & Related papers (2025-03-11T06:17:51Z) - Moderate-length lifted quantum Tanner codes [11.310502327308578]
We introduce new families of quantum Tanner codes, a class of quantum codes first appeared in the work of Leverrier and Z'emor.
We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and for which the distance surpasses the square root of the code length.
arXiv Detail & Related papers (2025-02-27T17:23:53Z) - 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) - Good binary quantum codes with transversal CCZ gate [0.0]
We give anally good family of quantum CSS codes on qubits with a CCZ gate.
As a corollary, the constructed code family provides a magic state distillation scheme with constant space overhead.
arXiv Detail & Related papers (2024-08-19T16:40:55Z) - Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes.
We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
arXiv Detail & Related papers (2024-06-17T20:48:43Z) - 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.<n>The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
arXiv Detail & Related papers (2023-12-18T13:18:19Z) - 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) - 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) - CSS code surgery as a universal construction [51.63482609748332]
We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes.
We describe code surgery between such codes using a specific colimit in the category of chain complexes.
arXiv Detail & Related papers (2023-01-31T16:17:25Z) - Divisible Codes for Quantum Computation [0.6445605125467572]
Divisible codes are defined by the property that codeword weights share a common divisor greater than one.
This paper explores how they can be used to protect quantum information as it is transformed by logical gates.
arXiv Detail & Related papers (2022-04-27T20:18:51Z) - 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.