Related papers: Non-rational Narain CFTs from codes over $F_4$
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
We study the connection between Rational Conformal Field Theory (RCFT), $N=2$ massive supersymmetric field theory, and solvable Interaction Round the Face (IRF) lattice models. Specifically, one identifies the fusion rings with the chiral…
We investigate orbifolds of lattice conformal field theories with the goal of constructing theories with large gap. We consider Barnes-Wall lattices, which are a family of lattices with no short vectors, and orbifold by an extraspecial…
Revisiting an approach by Conway and Sloane we investigate a collection of optimal non-linear binary codes and represent them as (non-linear) codes over Z4. The Fourier transform will be used in order to analyze these codes, which leads to…
There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…
We construct a class of chiral fermionic CFTs from classical codes over finite fields whose order is a prime number. We exploit the relationship between classical codes and Euclidean lattices to provide the Neveu-Schwarz sector of fermionic…
Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
In [Phys. Rev. A 58, 1833 (1998)] a family of polynomial invariants which separate the orbits of multi-qubit density operators $\rho$ under the action of the local unitary group was presented. We consider this family of invariants for the…
We perform a detailed investigation of Bipartite Field Theories (BFTs), a general class of 4d N=1 gauge theories which are defined by bipartite graphs. This class of theories is considerably expanded by identifying a new way of assigning…
We consider the family of renormalizable scalar QFTs with self-interacting potentials of highest monomial $\phi^{m}$ below their upper critical dimensions $d_c=\frac{2m}{m-2}$, and study them using a combination of CFT constraints,…
We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…
We give an asymptotically good family of quantum CSS codes on qubits with a transversal CCZ gate, meaning that the parallel logical CCZ on all logical qubits is performed by parallel physical CCZs on (a subset of) physical qubits. The…
An important measure of utility for a quantum code is the identification of which logical operations can be implemented fault-tolerantly on its codespace. We introduce a framework which leverages the automorphism groups of associated…
Rational conformal field theories in 2d have partition functions built from holomorphic characters, whose classification can be addressed via the holomorphic modular bootstrap. This is facilitated by a special basis of ``quasi-characters''…
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,…
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…
For any root system corresponding to a semisimple simply-laced Lie algebra a logarithmic CFT is constructed. Characters of irreducible representations were calculated in terms of theta functions.
There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic $\mathbb{F}_p$-vector spaces. In the language of the stabilizer…