Searcharxiv⌕ Search

arXiv subjects

Vishnu Jejjala

Publications and source records attributed to Vishnu Jejjala.

At least 37 records · Page 2Linked to original sources
arXiv2024

Precision String Phenomenology

Calabi--Yau compactifications of the $E_8\times E_8$ heterotic string provide a promising route to recovering the four-dimensional particle physics described by the Standard Model. While the topology of the Calabi--Yau space determines the overall matter content in the low-energy effective field theory, further details of the compactification geometry are needed to calculate the normalized physical couplings and masses of elementary particles. In this work, we present numerical computations of physical Yukawa couplings in a number of heterotic models in the standard embedding and demonstrate the existence of natural hierarchies, a coveted feature in string model building.

hep-th↗
arXiv2024

Generating Triangulations and Fibrations with Reinforcement Learning

We apply reinforcement learning (RL) to generate fine regular star triangulations of reflexive polytopes, that give rise to smooth Calabi-Yau (CY) hypersurfaces. We demonstrate that, by simple modifications to the data encoding and reward function, one can search for CYs that satisfy a set of desirable string compactification conditions. For instance, we show that our RL algorithm can generate triangulations together with holomorphic vector bundles that satisfy anomaly cancellation and poly-stability conditions in heterotic compactification. Furthermore, we show that our algorithm can be used to search for reflexive subpolytopes together with compatible triangulations that define fibration structures of the CYs.

hep-th↗
arXiv2024

New Calabi-Yau Manifolds from Genetic Algorithms

Calabi-Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi-Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

hep-th↗
arXiv2024

Physical Yukawa Couplings in Heterotic String Compactifications

One of the challenges of heterotic compactification on a Calabi-Yau threefold is to determine the physical $(\mathbf{27})^3$ Yukawa couplings of the resulting four-dimensional $\mathcal{N}=1$ theory. In general, the calculation necessitates knowledge of the Ricci-flat metric. However, in the standard embedding, which references the tangent bundle, we can compute normalized Yukawa couplings from the Weil-Petersson metric on the moduli space of complex structure deformations of the Calabi-Yau manifold. In various examples (the Fermat quintic, the intersection of two cubics in $\mathbb{P}^5$, and the Tian-Yau manifold), we calculate the normalized Yukawa couplings for $(2,1)$-forms using the Weil-Petersson metric obtained from the Kodaira-Spencer map. In cases where $h^{1,1}=1$, this is compared to a complementary calculation based on performing period integrals. A third expression for the normalized Yukawa couplings is obtained from a machine learned approximate Ricci-flat metric making use of explicit harmonic representatives. The excellent agreement between the different approaches opens the door to precision string phenomenology.

hep-th↗
arXiv2024

Topological data analysis on noisy quantum computers

Topological data analysis (TDA) is a powerful technique for extracting complex and valuable shape-related summaries of high-dimensional data. However, the computational demands of classical algorithms for computing TDA are exorbitant, and quickly become impractical for high-order characteristics. Quantum computers offer the potential of achieving significant speedup for certain computational problems. Indeed, TDA has been purported to be one such problem, yet, quantum computing algorithms proposed for the problem, such as the original Quantum TDA (QTDA) formulation by Lloyd, Garnerone and Zanardi, require fault-tolerance qualifications that are currently unavailable. In this study, we present NISQ-TDA, a fully implemented end-to-end quantum machine learning algorithm needing only a short circuit-depth, that is applicable to high-dimensional classical data, and with provable asymptotic speedup for certain classes of problems. The algorithm neither suffers from the data-loading problem nor does it need to store the input data on the quantum computer explicitly. The algorithm was successfully executed on quantum computing devices, as well as on noisy quantum simulators, applied to small datasets. Preliminary empirical results suggest that the algorithm is robust to noise.

quant-ph↗
arXiv2023

Learning to be Simple

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated subgroups of the symmetric group on n-objects and conduct a classification of finite simple groups among them using shallow feed-forward neural networks. We show that this neural network classifier can decipher the property of simplicity with varying accuracies depending on the features. Our neural network model leads to a natural conjecture concerning the generators of a finite simple group. We subsequently prove this conjecture. This new toy theorem comments on the necessary properties of generators of finite simple groups. We show this explicitly for a class of sporadic groups for which the result holds. Our work further makes the case for a machine motivated study of algebraic structures in pure mathematics and highlights the possibility of generating new conjectures and theorems in mathematics with the aid of machine learning.

cs.LG↗
arXiv2023

Modular factorization of superconformal indices

Superconformal indices of four-dimensional $\mathcal{N}=1$ gauge theories factorize into holomorphic blocks. We interpret this as a modular property resulting from the combined action of an $SL(3,\mathbb{Z})$ and $SL(2,\mathbb{Z})\ltimes \mathbb{Z}^2$ transformation. The former corresponds to a gluing transformation and the latter to an overall large diffeomorphism, both associated with a Heegaard splitting of the underlying geometry. The extension to more general transformations leads us to argue that a given index can be factorized in terms of a family of holomorphic blocks parametrized by modular (congruence sub)groups. We find precise agreement between this proposal and new modular properties of the elliptic $Γ$ function. This leads to our conjecture for the ``modular factorization'' of superconformal lens indices of general $\mathcal{N}=1$ gauge theories. We provide evidence for the conjecture in the context of the free chiral multiplet and SQED, and sketch the extension of our arguments to more general gauge theories. Based on this result, we systematically prove that a normalized part of superconformal lens indices defines a non-trivial first cohomology class associated with $SL(3,\mathbb{Z})$. Finally, we use this framework to propose a formula for the general lens space index.

hep-th↗
arXiv2023

Machine Learned Calabi-Yau Metrics and Curvature

Finding Ricci-flat (Calabi-Yau) metrics is a long standing problem in geometry with deep implications for string theory and phenomenology. A new attack on this problem uses neural networks to engineer approximations to the Calabi-Yau metric within a given Kähler class. In this paper we investigate numerical Ricci-flat metrics over smooth and singular K3 surfaces and Calabi-Yau threefolds. Using these Ricci-flat metric approximations for the Cefalú family of quartic twofolds and the Dwork family of quintic threefolds, we study characteristic forms on these geometries. We observe that the numerical stability of the numerically computed topological characteristic is heavily influenced by the choice of the neural network model, in particular, we briefly discuss a different neural network model, namely Spectral networks, which correctly approximate the topological characteristic of a Calabi-Yau. Using persistent homology, we show that high curvature regions of the manifolds form clusters near the singular points. For our neural network approximations, we observe a Bogomolov--Yau type inequality $3c_2 \geq c_1^2$ and observe an identity when our geometries have isolated $A_1$ type singularities. We sketch a proof that $χ(X~\smallsetminus~\mathrm{Sing}\,{X}) + 2~|\mathrm{Sing}\,{X}| = 24$ also holds for our numerical approximations.

hep-th↗
arXiv2022

Illuminating new and known relations between knot invariants

We automate the process of machine learning correlations between knot invariants. For nearly 200,000 distinct sets of input knot invariants together with an output invariant, we attempt to learn the output invariant by training a neural network on the input invariants. Correlation between invariants is measured by the accuracy of the neural network prediction, and bipartite or tripartite correlations are sequentially filtered from the input invariant sets so that experiments with larger input sets are checking for true multipartite correlation. We rediscover several known relationships between polynomial, homological, and hyperbolic knot invariants, while also finding novel correlations which are not explained by known results in knot theory. These unexplained correlations strengthen previous observations concerning links between Khovanov and knot Floer homology. Our results also point to a new connection between quantum algebraic and hyperbolic invariants, similar to the generalized volume conjecture.

math.GT↗
arXiv2022

Learning knot invariants across dimensions

We use deep neural networks to machine learn correlations between knot invariants in various dimensions. The three-dimensional invariant of interest is the Jones polynomial $J(q)$, and the four-dimensional invariants are the Khovanov polynomial $\text{Kh}(q,t)$, smooth slice genus $g$, and Rasmussen's $s$-invariant. We find that a two-layer feed-forward neural network can predict $s$ from $\text{Kh}(q,-q^{-4})$ with greater than $99\%$ accuracy. A theoretical explanation for this performance exists in knot theory via the now disproven knight move conjecture, which is obeyed by all knots in our dataset. More surprisingly, we find similar performance for the prediction of $s$ from $\text{Kh}(q,-q^{-2})$, which suggests a novel relationship between the Khovanov and Lee homology theories of a knot. The network predicts $g$ from $\text{Kh}(q,t)$ with similarly high accuracy, and we discuss the extent to which the machine is learning $s$ as opposed to $g$, since there is a general inequality $|s| \leq 2g$. The Jones polynomial, as a three-dimensional invariant, is not obviously related to $s$ or $g$, but the network achieves greater than $95\%$ accuracy in predicting either from $J(q)$. Moreover, similar accuracy can be achieved by evaluating $J(q)$ at roots of unity. This suggests a relationship with $SU(2)$ Chern--Simons theory, and we review the gauge theory construction of Khovanov homology which may be relevant for explaining the network's performance.

hep-th↗
arXiv2022

Representation of the Fermionic Boundary Operator

The boundary operator is a linear operator that acts on a collection of high-dimensional binary points (simplices) and maps them to their boundaries. This boundary map is one of the key components in numerous applications, including differential equations, machine learning, computational geometry, machine vision and control systems. We consider the problem of representing the full boundary operator on a quantum computer. We first prove that the boundary operator has a special structure in the form of a complete sum of fermionic creation and annihilation operators. We then use the fact that these operators pairwise anticommute to produce an $O(n)$-depth circuit that exactly implements the boundary operator without any Trotterization or Taylor series approximation errors. Having fewer errors reduces the number of shots required to obtain desired accuracies.

quant-ph↗
arXiv2022

Quantum Gravity and Phenomenology: Dark Matter, Dark Energy, Vacuum Selection, Emergent Spacetime, and Wormholes

We discuss the relevance of quantum gravity to the frontier questions in high energy phenomenology: the problems of dark matter, dark energy, and vacuum selection as well as the problems of emergent spacetime and wormholes. Dark matter and dark energy phenomenology, and the problem of vacuum selection are discussed within the context of string theory as a model of quantum gravity. Emergent spacetime and wormholes are discussed in a more general context of effective theories of quantum gravity.

hep-th↗
arXiv2022

First Principles Phenomenology of $H_0$

In this letter we discuss infinite statistics and motivate its role in quantum gravity. Then, we connect infinite statistics to a dynamical form of dark energy, and we obtain an expression for the evolution of the Hubble parameter that we compare to observation. The equation of state parameter $w_{eff} < -1$ in this framework.

gr-qc↗
arXiv2022

(K)not machine learning

We review recent efforts to machine learn relations between knot invariants. Because these knot invariants have meaning in physics, we explore aspects of Chern-Simons theory and higher dimensional gauge theories. The goal of this work is to translate numerical experiments with Big Data to new analytic results.

hep-th↗
arXiv2021

Machine Learning Kreuzer--Skarke Calabi--Yau Threefolds

Using a fully connected feedforward neural network we study topological invariants of a class of Calabi--Yau manifolds constructed as hypersurfaces in toric varieties associated with reflexive polytopes from the Kreuzer--Skarke database. In particular, we find the existence of a simple expression for the Euler number that can be learned in terms of limited data extracted from the polytope and its dual.

hep-th↗
arXiv2021

$SL(3,\mathbb{Z})$ Modularity and New Cardy Limits of the $\mathcal{N}=4$ Superconformal Index

The entropy of $1/16$-th BPS AdS$_5$ black holes can be microscopically accounted for by the superconformal index of the $\mathcal{N}=4$ super-Yang-Mills theory. One way to compute this is through a Cardy-like limit of a formula for the index obtained in [1] using the "$S$-transformation" of the elliptic $Γ$ function. In this paper, we derive more general $SL(3,\mathbb{Z})$ modular properties of the elliptic $Γ$ function. We then use these properties to obtain a three integer parameter family of generalized Cardy-like limits of the $\mathcal{N}=4$ superconformal index. From these limits, we obtain entropy formulae that have a similar form as that of the original AdS$_5$ black hole, up to an overall rescaling of the entropy. We interpret this both on the field theory and the gravitational side. Finally, we comment on how our work suggests a generalization of the Farey tail to four dimensions.

hep-th↗
arXiv2021

Disentangling a Deep Learned Volume Formula

We present a simple phenomenological formula which approximates the hyperbolic volume of a knot using only a single evaluation of its Jones polynomial at a root of unity. The average error is just $2.86$% on the first $1.7$ million knots, which represents a large improvement over previous formulas of this kind. To find the approximation formula, we use layer-wise relevance propagation to reverse engineer a black box neural network which achieves a similar average error for the same approximation task when trained on $10$% of the total dataset. The particular roots of unity which appear in our analysis cannot be written as $e^{2πi / (k+2)}$ with integer $k$; therefore, the relevant Jones polynomial evaluations are not given by unknot-normalized expectation values of Wilson loop operators in conventional $SU(2)$ Chern$\unicode{x2013}$Simons theory with level $k$. Instead, they correspond to an analytic continuation of such expectation values to fractional level. We briefly review the continuation procedure and comment on the presence of certain Lefschetz thimbles, to which our approximation formula is sensitive, in the analytically continued Chern$\unicode{x2013}$Simons integration cycle.

hep-th↗