Related papers: Quantum codes from superelliptic curves
Algebraic geometry codes on the Hermitian curve have been the subject of several papers, since they happen to have good performances and large automorphism groups. Here, those arising from the Singer cycle of the Hermitian curve are…
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…
We show that in many cases, the automorphism group of a curve and the permutation automorphism group of a corresponding AG code are the same. This generalizes a result of Wesemeyer beyond the case of planar curves.
In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…
In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…
We show that for $q\in (0,1),$ the $C^{*}$-algebra $SU_{q}(3)$ is isomorphic a rank $2$ graph $C^{*}$-algebra (in the sense of Pask and Kumjian). This graph is derived by passing the to the limit $q\to 0$ for a set of generators of…
Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $\mathbf{ \lambda_a=0} $, and in all but one case a cross correlation of $ \mathbf{\lambda_c=1} $. All…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of…
We are concerned with the question of determining the set $C(\mathbb{Q})$, where $C$ is a curve defined by an equation of the form $y^q=f(x)$, where $q$ is an odd prime and $f$ is a polynomial defined over $\mathbb{Q}$. This question can…
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
Let C be a curve (possibly non reduced or reducible) lying on a smooth algebraic surface. We show that the canonical ring R(C, \omega_C) is generated in degree 1 if C is numerically 4-connected, not hyperelliptic and even (i.e. with K_C of…
Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…
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…
A long standing problem has been to develop "good" binary linear codes to be used for error-correction. This paper investigates in some detail an attack on this problem using a connection between quadratic residue codes and hyperelliptic…
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…