Engineering Papers⌕ Search

Engineering topics

Halverson, James

Publications and source records attributed to Halverson, James.

Infinite neural network quantum states: entanglement and training dynamics

We study infinite limits of neural network quantum states (∞-NNQS), which exhibit representation power through ensemble statistics, and also tractable gradient descent dynamics. Ensemble averages of entanglement entropies are expressed in terms of neural network correlators, and architectures that exhibit volume-law entanglement are presented. The analytic calculations of entanglement entropy bound are tractable because the ensemble statistics are simplified in the Gaussian process limit. A general framework is developed for studying the gradient descent dynamics of neural network quantum states (NNQS), using a quantum state neural tangent kernel (QS-NTK). For ∞-NNQS the training dynamics is simplified, since the QS-NTK becomes deterministic and constant. An analytic solution is derived for quantum state supervised learning, which allows an ∞-NNQS to recover any target wavefunction. Numerical experiments on finite and infinite NNQS in the transverse field Ising model and Fermi Hubbard model demonstrate excellent agreement with theory. ∞-NNQS opens up new opportunities for studying entanglement and training dynamics in other physics applications, such as in finding ground states.

quantum state supervised learning↗

Geometry and Strings 2023

The proposal details plans for an upcoming meeting as part of the annual Geometry and Strings conference series. This series was formerly known as the ``F-theory'' conference series and has since broadened to include more general approaches to high energy physics centered on geometry, quantum field theory and string theory. The University of Pennsylvania has agreed to host the 2023 installment of the conference, which will take place on the UPenn campus in March 2023. The main thrust of the activities will center on several interconnected areas within the subject, including: The Swampland Program in quantum gravity and its geometric manifestations. The Geometric Engineering Program in string theory and its application to numerous question in quantum field theory. The Generalized Symmetries Program in quantum field theory and string theory. The Machine Learning Program aimed at understanding the large number of vacua present in string theory. The conference will adhere to a code of conduct aimed at making the event accessible to all participants. Additionally, particular attention will be paid to having a balanced mix of junior, mid-level and senior speakers from diverse backgrounds.

Lust, Dieter↗

6D anomaly-free matter spectrum in F-theory on singular spaces

In this paper we study the 6d localized charged matter spectrum of F-theory directly on a singular elliptic Calabi-Yau 3-fold, i.e. without smoothing via resolution or deformation of the entire fibration. Given only the base surface, discriminant locus, and the SL(2, $\mathbb{Z}$) local system, we propose a general prescription for determining the charged matter spectrum localized at intersections of seven-branes, using the technology of string junctions. More precisely, at each codimension-2 collision of seven-branes, we determine the local seven-brane content and compute the number of massless string junctions modulo the action of the SL(2,$\mathbb{Z}$) monodromy. We find agreement with the predicted results from 6d anomaly cancellation in all cases considered. Examples include a generic Weierstrass model with arbitrary Kodaira fiber intersecting an I 1 , as well as cases with jointly charged matter localized at intersections of non-abelian seven-branes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning to Unknot

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an algorithm to randomly generate N-crossing braids and their knot closures and discussing the induced prior on the distribution of knots, we apply binary classification to the UNKNOT decision problem. We find that the Reformer and shared-QK Transformer network architectures outperform fully-connected networks, though all perform at 95% accuracy. Perhaps surprisingly, we find that accuracy increases with the length of the braid word, and that the networks learn a direct correlation between the confidence of their predictions and the degree of the Jones polynomial. Finally, we utilize reinforcement learning (RL) to find sequences of Markov moves and braid relations that simplify knots and can identify unknots by explicitly giving the sequence of unknotting actions. Trust region policy optimization (TRPO) performs consistently well, reducing 80% of the unknots with up to 96 crossings we tested to the empty braid word, and thoroughly outperformed other RL algorithms and random walkers. Studying these actions, we find that braid relations are more useful in simplifying to the unknot than one of the Markov moves.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗