Related papers: Quantum Goppa Codes over Hyperelliptic Curves
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
The hypergraph product creates a quantum stabilizer code from two input classical linear codes; a paradigmatic example being the surface code as a hypergraph product of two classical repetition codes. Many properties of the hypergraph…
We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…
This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…
Let $g$ be an even positive integer, and $p$ be a prime number. We compute the cohomological invariants with coefficients in $\mathbb{Z}/p\mathbb{Z}$ of the stacks of hyperelliptic curves $\mathscr{H}_g$ over an algebraically closed field…
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the…
In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…
Product code construction is a powerful tool for constructing quantum stabilizer codes, which serve as a promising paradigm for realizing fault-tolerant quantum computation. Furthermore, the natural mapping between stabilizer codes and the…
This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…
I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a…
A code over GF$(q^m)$ can be imaged or expanded into a code over GF$(q)$ using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems…
The topic of this thesis is the development of a versatile and geometrically motivated differential calculus on non-commutative or quantum spaces, providing powerful but easy-to-use mathematical tools for applications in physics and related…
The subalgebra of the tautological ring of the moduli of curves of compact type generated by the kappa classes is studied. Relations, constructed via the virtual geometry of the moduli of stable maps, are used to prove universality results…
In this paper we study overcomplete systems of coherent states associated to compact integral symplectic manifolds by geometric quantization. Our main goals are to give a systematic treatment of the construction of such systems and to…
An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…
Several local elliptic coordinates are used to build a new polyelliptic coordinate system which is orthogonal and admits the separation of variables. Such coordinate systems can give the exact solutions of some unsolved problems in quantum…
We discuss how to use the recent progress in understanding of the $x$-$y$ duality and symplectic duality in the theory of topological recursion and its generalizations in order to efficiently compute the quantum spectral curve operators for…
In this paper we consider the question of whether there exists a hyperelliptic curve of genus $g$ which is defined over $\FF_q$ but has no rational points over $\FF_q$ for various pairs $(g,q)$.
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…