Monte Carlo methods are widely used importance sampling techniques for studying complex physical systems. Integrating these methods with deep learning has significantly improved efficiency and accuracy in high-dimensional problems and complex system simulations. However, these neural network-enhanced Monte Carlo methods still face challenges such as slow sampling speeds, statistical bias, and inaccuracies in the ground state. To address these issues, we propose a variational evolutionary network, which utilizes neural networks for variational free energy and combines evolutionary algorithms for sampling. During the sampling process, we construct generation and selection operators to filter samples based on importance, thereby achieving efficient importance sampling. We demonstrate that this sampling method provides an upper bound on the ground-state energy, enhancing both sampling efficiency and ground-state accuracy. Moreover, we numerically examine our method in two-dimensional Ising model and Sherrington-Kirkpatrick Model for spin glass. Thus, our algorithm could offer improved accuracy in handling complex energy landscapes and significantly enhance computational efficiency.
Monte Carlo methods are widely used importance sampling techniques for studying complex physical systems. Integrating these methods with deep learning has significantly improved efficiency and accuracy in high-dimensional problems and complex system simulations. However, these neural network-enhanced Monte Carlo methods still face challenges such as slow sampling speeds, statistical bias, and inaccuracies in the ground state. To address these issues, we propose a variational evolutionary network, which utilizes neural networks for variational free energy and combines evolutionary algorithms for sampling. During the sampling process, we construct generation and selection operators to filter samples based on importance, thereby achieving efficient importance sampling. We demonstrate that this sampling method provides an upper bound on the ground-state energy, enhancing both sampling efficiency and ground-state accuracy. Moreover, we numerically examine our method in two-dimensional Ising model and Sherrington-Kirkpatrick Model for spin glass. Thus, our algorithm could offer improved accuracy in handling complex energy landscapes and significantly enhance computational efficiency.
Abstract Computing free energy is a fundamental problem in statistical physics. Recently, two distinct methods have been developed and have demonstrated remarkable success: the tensor-network-based contraction method and the neural-network-based variational method. Tensor networks are accurate, but their application is often limited to low-dimensional systems due to the high computational complexity in high-dimensional systems. The neural network method applies to systems with general topology. However, as a variational method, it is not as accurate as tensor networks. In this work, we propose an integrated approach, tensor-network-based variational autoregressive networks (TNVAN), that leverages the strengths of both tensor networks and neural networks: combining the variational autoregressive neural network’s ability to compute an upper bound on free energy and perform unbiased sampling from the variational distribution with the tensor network’s power to accurately compute the partition function for small sub-systems, resulting in a robust method for precisely estimating free energy. To evaluate the proposed approach, we conducted numerical experiments on spin glass systems with various topologies, including two-dimensional lattices, fully connected graphs, and random graphs. Our numerical results demonstrate the superior accuracy of our method compared to existing approaches. In particular, it effectively handles systems with long-range interactions and leverages GPU efficiency without requiring singular value decomposition, indicating great potential in tackling statistical mechanics problems and simulating high-dimensional complex systems through both tensor networks and neural networks.
We propose a general framework for solving statistical mechanics of systems with finite size. The approach extends the celebrated variational mean-field approaches using autoregressive neural networks, which support direct sampling and exact calculation of normalized probability of configurations. It computes variational free energy, estimates physical quantities such as entropy, magnetizations and correlations, and generates uncorrelated samples all at once. Training of the network employs the policy gradient approach in reinforcement learning, which unbiasedly estimates the gradient of variational parameters. We apply our approach to several classic systems, including 2D Ising models, the Hopfield model, the Sherrington-Kirkpatrick model, and the inverse Ising model, for demonstrating its advantages over existing variational mean-field methods. Our approach sheds light on solving statistical physics problems using modern deep generative neural networks.
Neural network quantum states (NQS), incorporating with variational Monte Carlo (VMC) method, are shown to be a promising way to investigate quantum many-body physics. Whereas vanilla VMC methods perform one gradient update per sample, we introduce a novel objective function with proximal optimization (PO) that enables multiple updates via reusing the mismatched samples. Our VMC-PO method keeps the advantage of the previous importance sampling gradient optimization algorithm [L. Yang, {\it et al}, Phys. Rev. Research {\bf 2}, 012039(R)(2020)] that efficiently uses sampled states. PO mitigates the numerical instabilities during network updates, which is similar to stochastic reconfiguration (SR) methods, but achieves an alternative and simpler implement with lower computational complexity. We investigate the performance of our VMC-PO algorithm for ground-state searching with a 1-dimensional transverse-field Ising model and 2-dimensional Heisenberg antiferromagnet on a square lattice, and demonstrate that the reached ground-state energies are comparable to state-of-the-art results.
Monte Carlo methods are essential across diverse scientific fields, yet their efficiency is frequently hampered by critical slowing down-a sharp increase in autocorrelation times near phase transitions. Although deep learning approaches, such as neural-network-based samplers, have been proposed to alleviate this issue, they face another serious problem: the difficulty of training the models. This difficulty partially stems from the overly general nature of original machine-learning architectures, which often ignore underlying physical symmetries and force networks to relearn them from scratch. In this paper, we demonstrate that incorporating physical priors into the model significantly enhances performance. Building upon existing strategies that integrate spin-spin interactions, we propose a framework that utilizes a prior probability distribution as a starting point for training. Our results for the Ising model, as well as for the Edwards-Anderson spin glass model, suggest that moving away from `blank slate' models in favor of physics-informed priors reduces the training burden and facilitates the simulation of larger system sizes in discrete spin models.
Artificial neural networks were recently shown to be an efficient representation of highly entangled many-body quantum states. In practical applications, neural-network states inherit numerical schemes used in variational Monte Carlo method, most notably the use of Markov-chain Monte Carlo (MCMC) sampling to estimate quantum expectations. The local stochastic sampling in MCMC caps the potential advantages of neural networks in two ways: (i) Its intrinsic computational cost sets stringent practical limits on the width and depth of the networks, and therefore limits their expressive capacity; (ii) its difficulty in generating precise and uncorrelated samples can result in estimations of observables that are very far from their true value. Inspired by the state-of-the-art generative models used in machine learning, we propose a specialized neural-network architecture that supports efficient and exact sampling, completely circumventing the need for Markov-chain sampling. We demonstrate our approach for two-dimensional interacting spin models, showcasing the ability to obtain accurate results on larger system sizes than those currently accessible to neural-network quantum states.
The solution of Schrödinger equation generates the quantisation properties of the system, which can completely describe the quantum behaviour of microscopic particles in a physical system. However, solving the Schrödinger equation is a non-deterministic polynomial time (NP)-hard problem. Numerical methods for solving the Schrödinger equation require careful selection of basis configurations, and the complete basis set has high accuracy but its complexity increases exponentially in the number of particles. Therefore, it is crucial to find an effective numerical method. To solve this problem, this paper present a deep learning architecture, VMCNet, using the powerful computational efficiency of neural networks to improve the speed of numerical computation. Moreover, this paper proposes a suitable wavefunction ansatz, witch determines the accuracy of neural networks, that achieves more accurate energy solutions of the many-electron Schrödinger equation compared to the conventional single-determinant variational molecular Monte Carlo. We introduce non-local and local blocks to represent quantum mechanical interactions, which contain more physical information about the particle system. The experimental results show that VMCNet can cover more than 93% of the correlation energy of the main group elements (Be–Ne) for the monoatomic system and more than 90% of the correlation energy for the diatomic system.