Related papers: Quantum Margulis Codes
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes…
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. Most properties of the classical walk carry over to the quantum operation: degree becomes the number of Kraus operators,…
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
A theory of canonical basis for a two-parameter quantum algebra is developed in parallel with the one in one-parameter case. A geometric construction of the negative part of a two-parameter quantum algebra is given by using mixed perverse…
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…
We present a universal framework for quantum error-correcting codes, i.e., the one that applies for the most general quantum error-correcting codes. This framework is established on the group algebra, an algebraic notation for the nice…
In this note, we construct dual PBW bases of the positive and negative subalgebras of the two-parameter quantum groups $U_{r,s}(\mathfrak{g})$ in classical types, as used in our earlier work arXiv:2407.01450. Following the ideas of Leclerc…
Recently, it was shown that when reference frames are associated to quantum systems, the transformation laws between such quantum reference frames need to be modified to take into account the quantum and dynamical features of the reference…
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…
In this paper, necessary and sufficient conditions for the self-orthogonality of t-generator quasi-cyclic (QC) codes are presented under the Euclidean, Hermitian, and symplectic inner products, respectively. Particularly, by studying the…
In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable…
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
In this study, in order to get better codes, we focus on double skew cyclic codes over the ring $\mathrm{R}= \mathbb{F}_q+v\mathbb{F}_q, ~v^2=v$ where $q$ is a prime power. We investigate the generator polynomials, minimal spanning sets,…
In this work, we introduce constructions for non-Abelian qLDPC codes obtained by gauging transversal Clifford gates using measurement and feedback. In particular, we identify two qualitatively different approaches to gauging qLDPC codes to…
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…