2000 character limit reached
Non-rational Narain CFTs from codes over $F_4$
Published 6 Jul 2021 in hep-th, cs.IT, math.IT, and quant-ph | (2107.02816v1)
Abstract: We construct a map between a class of codes over $F_4$ and a family of non-rational Narain CFTs. This construction is complementary to a recently introduced relation between quantum stabilizer codes and a class of rational Narain theories. From the modular bootstrap point of view we formulate a polynomial ansatz for the partition function which reduces modular invariance to a handful of algebraic easy-to-solve constraints. For certain small values of central charge our construction yields optimal theories, i.e. those with the largest value of the spectral gap.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.