{"title":"Paths towards time evolution with larger neural-network quantum states","authors":"Wenxuan Zhang , Bo Xing , Xiansong Xu , Dario Poletti","doi":"10.1016/j.cpc.2025.109577","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, neural-network quantum states method in conjunction with the time-dependent variational Monte Carlo have been proposed to study the dynamics of many-body quantum systems. By interpreting the quantum dynamics problem as a ground state search of an effective Hamiltonian, we show that one can use stochastic reconfiguration (SR), a remarkable method that significantly boosts the efficiency and convergence of the variational training. Furthermore, since the vanilla SR method does not scale efficiently when the size of neural-network quantum states increases, we transfer to the study of time-dependent systems, or introduce altogether, three approaches that reduce the computational complexity of the SR method, and we compare their performance: Kronecker-factored approximate curvature (K-FAC), minimum-step stochastic reconfiguration (minSR), and sequential overlapping optimization (SOO). To demonstrate the generality of these approaches, we use both the restricted Boltzmann machine and the feed-forward neural network. We consider a titled Ising model and study the quantum quench from the paramagnetic to the anti-ferromagnetic phase. We show that the three approaches allow to use stochastic reconfigurations to describe the time evolution of a many-body quantum system using a neural network with more than 10000 parameters, which would be prohibitive otherwise. For systems up to 40 spins, we observe that minSR and SOO have similar performance and both provide better accuracy than K-FAC.</div></div>","PeriodicalId":285,"journal":{"name":"Computer Physics Communications","volume":"312 ","pages":"Article 109577"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Physics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010465525000803","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, neural-network quantum states method in conjunction with the time-dependent variational Monte Carlo have been proposed to study the dynamics of many-body quantum systems. By interpreting the quantum dynamics problem as a ground state search of an effective Hamiltonian, we show that one can use stochastic reconfiguration (SR), a remarkable method that significantly boosts the efficiency and convergence of the variational training. Furthermore, since the vanilla SR method does not scale efficiently when the size of neural-network quantum states increases, we transfer to the study of time-dependent systems, or introduce altogether, three approaches that reduce the computational complexity of the SR method, and we compare their performance: Kronecker-factored approximate curvature (K-FAC), minimum-step stochastic reconfiguration (minSR), and sequential overlapping optimization (SOO). To demonstrate the generality of these approaches, we use both the restricted Boltzmann machine and the feed-forward neural network. We consider a titled Ising model and study the quantum quench from the paramagnetic to the anti-ferromagnetic phase. We show that the three approaches allow to use stochastic reconfigurations to describe the time evolution of a many-body quantum system using a neural network with more than 10000 parameters, which would be prohibitive otherwise. For systems up to 40 spins, we observe that minSR and SOO have similar performance and both provide better accuracy than K-FAC.
期刊介绍:
The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper.
Computer Programs in Physics (CPiP)
These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged.
Computational Physics Papers (CP)
These are research papers in, but are not limited to, the following themes across computational physics and related disciplines.
mathematical and numerical methods and algorithms;
computational models including those associated with the design, control and analysis of experiments; and
algebraic computation.
Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.