Leveraging recurrence in neural network wavefunctions for large-scale simulations of Heisenberg antiferromagnets on the square lattice
Bibliographic record
Abstract
Machine-learning-based variational Monte Carlo simulations are a promising approach for targeting quantum many-body ground states, especially in two dimensions and in cases where the ground state is known to have a nontrivial sign structure. While many state-of-the-art variational energies have been reached with these methods for finite-size systems, little work has been done to use these results to extract information about the target state in the thermodynamic limit. In this work, we employ recurrent neural networks (RNNs) as a variational ans\"atze, and leverage their recurrent nature to simulate the ground states of progressively larger systems through iterative retraining. This transfer learning technique allows us to simulate spin-$\frac{1}{2}$ systems on lattices with more than 1,000 spins without beginning optimization from scratch for each system size, thus reducing the demands for computational resources. In this study, we focus on the square-lattice antiferromagnetic Heisenberg model, where it is possible to carefully benchmark our results. We show that we are able to systematically improve the accuracy of the results from our simulations by increasing the training time, and obtain results for finite-sized lattices that are in good agreement with the literature values. Furthermore, we use these results to extract accurate estimates of the ground-state properties in the thermodynamic limit. This work demonstrates that RNN wavefunctions are able to extract accurate information about quantum many-body systems in the thermodynamic limit.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".