Related papers: On certain self-orthogonal AG codes with applicati…
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
The hypergraph product (HGP) construction of quantum error-correcting codes (QECC) offers a general and explicit method for building a QECC from two classical codes, thereby paving the way for the discovery of good quantum low-density…
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…
We construct an arithmetic analogue of the quantum local systems on the moduli of curves, and study its basic structure. Such an arithmetic local system gives rise to a uniform way of assigning a Galois cohomology class of the first…
Quantum curves arise from Seiberg-Witten curves associated to 4d $\mathcal{N}=2$ gauge theories by promoting coordinates to non-commutative operators. In this way the algebraic equation of the curve is interpreted as an operator equation…
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
We use mirror symmetry, quantum geometry and modularity properties of elliptic curves to calculate the refined free energies in the Nekrasov-Shatashvili limit on non-compact toric Calabi-Yau manifolds, based on del Pezzo surfaces. Quantum…
In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…
In this paper we generalize the construction of binary self-orthogonal codes obtained from weakly self-orthogonal designs described by Tonchev in [12] in order to obtain self-orthogonal codes over an arbitrary field. We extend construction…
We describe geometrically the classical and quantum inhomogeneous groups $G_0=(SL(2, \BbbC)\triangleright \BbbC^2)$ and $G_1=(SL(2, \BbbC)\triangleright \BbbC^2)\triangleright \BbbC$ by studying explicitly their shape algebras as a spaces…
In this paper, we utilize a concatenation scheme to construct new families of quantum error correction codes achieving the quantum Gilbert-Varshamov (GV) bound asymptotically. We concatenate alternant codes with any linear code achieving…
We will demonstrate how calculations in toric geometry can be used to compute quantum corrections to the relations in the chiral ring for certain gauge theories. We focus on the gauge theory of the del Pezzo 2, and derive the chiral ring…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…
Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…
In this paper, we study binary triorthogonal codes and their relation to CSS-T quantum codes. We characterize the binary triorthogonal codes that are minimal or maximal with respect to the CSS-T poset, and we also study how to derive new…
Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…
We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are…
Quantum error correcting codes protect quantum computation from errors caused by decoherence and other noise. Here we study the problem of designing logical operations for quantum error correcting codes. We present an automated procedure…
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…