Related papers: Quantum Margulis Codes

Quantum Margulis Codes

URL: http://arxiv.org/abs/2409.09830v1
Date: Sun, 15 Sep 2024 19:08:34 GMT
Title: Quantum Margulis Codes
Authors: Michele Pacenti, Bane Vasic,
Abstract summary: 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.
Score: 3.3148826359547514
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Recently, Lin and Pryadko presented the quantum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum equivalent of the well-known classical Margulis code. In this paper, we first present an alternative description of the two-block group algebra codes using the left-right Cayley complex; then, we show how to modify the construction of Margulis to get a two-block algebra code. Finally, we construct several quantum Margulis codes and evaluate their performance with numerical simulations.

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)
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 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)
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)
Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes [16.55015892533456]
The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. A refined lower bound on the minimum distance of the resulting quantum codes is established. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
arXiv Detail & Related papers (2024-05-23T21:10:23Z)
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)
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)
New Binary Quantum Codes Constructed from Quasi-Cyclic Codes [6.718184400443239]
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing. As an application, we construct 8 binary quantum codes that exceed the best-known results.
arXiv Detail & Related papers (2021-12-14T03:22:16Z)
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.