Related papers: Generalizing Quantum Tanner Codes
We give a construction of quantum LDPC codes of dimension $\Theta(\log N)$ and distance $\Theta(N/\log N)$ as the code length $N\to\infty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of…
We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the…
In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…
We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve…
For a graph $\Gamma=(V\Gamma,E\Gamma)$, a subset $D$ of $V\Gamma$ is a perfect code in $\Gamma$ if every vertex of $\Gamma$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on…
In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…
In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node…
Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
We elaborate on the notion of generalized tomograms, both in the classical and quantum domains. We construct a scheme of star-products of thick tomographic symbols and obtain in explicit form the kernels of classical and quantum generalized…
Families of expander graphs were first constructed by Margulis from discrete groups with property (T). Within the framework of quantum information theory, several authors have generalised the notion of an expander graph to the setting of…
We introduce a class of linear maps irreducibly covariant with respect to the finite group generated by the Weyl operators. This group provides a direct generalization of the quaternion group. In particular, we analyze the irreducibly…
We introduce new families of pure quantum states that are constructed on top of the well-known Gilmore-Perelomov group-theoretic coherent states. We do this by constructing unitaries as the exponential of operators quadratic in Cartan…
Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a…
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…
This paper introduces a class of structured lowdensity parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtained from Latin squares and form a finite field under some…
We detail for the first time a complete explicit description of the quasi-cyclic structure of all classical finite generalized quadrangles. Using these descriptions we construct families of quasi-cyclic LDPC codes derived from the…
Generalized quantum cluster algebras introduced in [1] are quantum deformation of generalized cluster algebras of geometric types. In this paper, we prove that the Laurent phenomenon holds in these generalized quantum cluster algebras. We…
We propose a notion of lift for quantum CSS codes, inspired by the geometrical construction of Freedman and Hastings. It is based on the existence of a canonical complex associated to any CSS code, that we introduce under the name of Tanner…