Related papers: Non-rational Narain CFTs from codes over $F_4$
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
We present a family of quantum stabilizer codes using the structure of duadic constacyclic codes over $\mathbb{F}_4$. Within this family, quantum codes can possess varying dimensions, and their minimum distances are lower bounded by a…
We consider chiral fermionic conformal field theories (CFTs) constructed from lattices and investigate their orbifolds under reflection and shift $\mathbb{Z}_2$ symmetries. For lattices based on binary error-correcting codes, we show the…
We study the conformal bootstrap constraints for 4D $\mathcal{N}=1$ superconformal field theories containing a chiral operator $\phi$ and the chiral ring relation $\phi^2=0$. Hints for a minimal interacting SCFT in this class have appeared…
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Quasi-characters are vector-valued modular functions having an integral, but not necessarily positive, q-expansion. Using modular differential equations, a complete classification has been provided in arXiv:1810.09472 for the case of two…
In this research paper, our primary focus revolves around the domain-specific hardware mapping strategy tailored for Quantum Fourier Transformation (QFT) circuits. While previous approaches have heavily relied on SAT solvers or heuristic…
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…
We study two-dimensional (4,4) superconformal field theories of central charge c=6, corresponding to nonlinear sigma models on K3 surfaces, using the superconformal bootstrap. This is made possible through a surprising relation between the…
Morphisms between schemes arising from multigraded rings are essential for understanding geometric relationships in algebraic geometry, yet a systematic theory for such maps has been lacking. In this paper, we develop a comprehensive…
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…
We study general maps from the space of rational CFTs with a fixed chiral algebra and associated Chern-Simons (CS) theories to the space of qudit stabilizer codes with a fixed generalized Pauli group. We consider certain natural constraints…
A detailed study of the charge spectrum of three dimensional Abelian Topological Massive Gauge Theory (TMGT) is given. When this theory is defined on a manifold with two disconnected boundaries there are induced chiral Conformal Field…
Among (conformal) quantum field theories, the rational conformal field theories are singled out by the fact that their correlators can be constructed from a modular tensor category C with a distinguished object, a symmetric special…
The correlators of two-dimensional rational conformal field theories that are obtained in the TFT construction of [FRSI,FRSII,FRSIV] are shown to be invariant under the action of the relative modular group and to obey bulk and boundary…
We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework allows us to enforce stabilizer commutation, $X/Z$ balancing,…
Marginalising over families of Gaussian Process kernels produces flexible model classes with well-calibrated uncertainty estimates. Existing approaches require likelihood evaluations of many kernels, rendering them prohibitively expensive…
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…