Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2210.16493

Neural network quantum state with proximal optimization: a ground-state searching scheme based on variational Monte Carlo

Feng Chen, Ming Xue

Published Oct 29, 2022• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2210.16493

Related papers

Generalized Lanczos method for systematic optimization of neural-network quantum states

Jia-Qi Wang, Rong-Qiang He, Zhong-Yi Lu

Recently, artificial intelligence for science has made significant inroads into various fields of natural science research. In the field of quantum many-body computation, researchers have developed numerous ground state solvers based on neural-network quantum states (NQSs), achieving ground state energies with accuracy comparable to or surpassing traditional methods such as variational Monte Carlo methods, density matrix renormalization group, and quantum Monte Carlo methods. Here, we combine supervised learning, variational Monte Carlo (VMC), and the Lanczos method to develop a systematic approach to improving the NQSs of many-body systems, which we refer to as the NQS Lanczos method. The algorithm mainly consists of two parts: the supervised learning part and the VMC optimization part. Through supervised learning, the Lanczos states are represented by the NQSs. Through VMC, the NQSs are further optimized. We analyze the reasons for the underfitting problem and demonstrate how the NQS Lanczos method systematically improves the energy in the highly frustrated regime of the two-dimensional Heisenberg $J_1$-$J_2$ model. Compared to the existing method that combines the Lanczos method with the restricted Boltzmann machine, the primary advantage of the NQS Lanczos method is its linearly increasing computational cost.

arXiv:2502.01264•Physical review. B./Physical review. B•Jan 13, 2026•2 citations

Looking elsewhere: improving variational Monte Carlo gradients by importance sampling

Antoine Misery, Luca Gravina, Alessandro Santini +1 more

Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.

arXiv:2507.05352•Machine Learning Science and Technology•Jan 14, 2026•15 citations

Quantum neural network quantum state

Xin Pang, Yanan Li, Zhimin Wang

Quantum many-body computation is a central challenge across multiple domains of scientific research, and Monte Carlo method has emerged as one of the most effective numerical techniques for investigating large-scale many-body systems. In recent years, the integration of Monte Carlo methods with machine learning has led to the development of neural quantum state approach. Quantum neural networks (QNNs) offer superior expressiveness compared to classical neural networks. In this paper, we propose a novel Quantum Neural Network Quantum State (QNNQS) method, based on the variational Monte Carlo framework. This approach leverages a quantum neural network to represent the many-body quantum state, and optimizes it iteratively through gradient descent to determine the ground-state energy. To assess the performance of this method, we conduct simulations of the one-dimensional transverse-field Ising model, investigating the influence of quantum circuit architecture on circuit expressibility, entangling capability, and computational accuracy. The results demonstrate that the QNNQS method achieves comparable simulation accuracy while utilizing significantly fewer parameters and requiring less training resources than classical network quantum state methods.

International Conference on Algorithms, Network, and Communication Technology (ICANCT)•Mar 3, 2025•2 citations

A Nonstochastic Optimization Algorithm for Neural-Network Quantum States

Xiang Li, Jia-Cheng Huang, Guang-Ze Zhang +4 more

Neural-network quantum states (NQS) employ artificial neural networks to encode many-body wave functions in a second quantization through variational Monte Carlo (VMC). They have recently been applied to accurately describe electronic wave functions of molecules and have shown the challenges in efficiency compared with traditional quantum chemistry methods. Here, we introduce a general nonstochastic optimization algorithm for NQS in chemical systems, which deterministically generates a selected set of important configurations simultaneously with energy evaluation of NQS. This method bypasses the need for Markov-chain Monte Carlo within the VMC framework, thereby accelerating the entire optimization process. Furthermore, this newly developed nonstochastic optimization algorithm for NQS offers comparable or superior accuracy compared to its stochastic counterpart and ensures more stable convergence. The application of this model to test molecules exhibiting strong electron correlations provides further insight into the performance of NQS in chemical systems and opens avenues for future enhancements.

arXiv:2305.12776•Journal of Chemical Theory and Computation•Nov 14, 2023•21 citations

Variational optimization of the amplitude of neural-network quantum many-body ground states

Jia-Qi Wang, Han-Qing Wu, Rong-Qiang He +1 more

Neural-network quantum states (NQSs), variationally optimized by combining traditional methods and deep learning techniques, is a new way to find quantum many-body ground states and has gradually become a competitor of traditional variational methods. However, there are still some difficulties in the optimization of NQSs, such as local minima, slow convergence, and sign structure optimization. Here, we split a quantum many-body variational wave function into a multiplication of a real-valued amplitude neural network and a sign structure, and focus on the optimization of the amplitude network while keeping the sign structure fixed. The amplitude network is a convolutional neural network (CNN) with residual blocks, namely a residual network (ResNet). Our method is tested on three typical quantum many-body systems. The obtained ground state energies are better than or comparable to those from traditional variational Monte Carlo methods and density matrix renormalization group. Surprisingly, for the frustrated Heisenberg ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model, our results are better than those of the complex-valued CNN in the literature, implying that the sign structure of the complex-valued NQS is difficult to optimize. We will study the optimization of the sign structure of NQSs in the future.

arXiv:2308.09664•Physical review. B./Physical review. B•Jun 14, 2024•16 citations

One More Time: Revisiting Neural Quantum States from a Reinforcement Learning Perspective

Juan Agustín Duque, Sergio García Heredia, Vinicius Hernandes +4 more

Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods. Yet their optimization remains comparatively underexplored: Adam is a scalable method but ignores function space geometry, while stochastic reconfiguration is principled but costly and numerically fragile in large models. To address this gap, we show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution, motivating trust-region optimization for NQS training. We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel and phase increments in the phase channel. PWO avoids explicit matrix inversion, reuses samples across multiple updates, and combines the scalability of first-order optimization with theoretical guarantees. Across Ising and frustrated $J_1$-$J_2$ one- and two-dimensional spin systems, PWO improves stability and wall-clock convergence over Adam, minSR, and SPRING. Finally, we fine-tune a $1.5$B-parameter RWKV-7 model, demonstrating NQS optimization at a scale over three orders of magnitude beyond prior work.

cs.LGCross-listedarXiv:2607.02292•Jul 3, 2026•1 citation
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.
Recently, artificial intelligence for science has made significant inroads into various fields of natural science research. In the field of quantum many-body computation, researchers have developed numerous ground state solvers based on neural-network quantum states (NQSs), achieving ground state energies with accuracy comparable to or surpassing traditional methods such as variational Monte Carlo methods, density matrix renormalization group, and quantum Monte Carlo methods. Here, we combine supervised learning, variational Monte Carlo (VMC), and the Lanczos method to develop a systematic approach to improving the NQSs of many-body systems, which we refer to as the NQS Lanczos method. The algorithm mainly consists of two parts: the supervised learning part and the VMC optimization part. Through supervised learning, the Lanczos states are represented by the NQSs. Through VMC, the NQSs are further optimized. We analyze the reasons for the underfitting problem and demonstrate how the NQS Lanczos method systematically improves the energy in the highly frustrated regime of the two-dimensional Heisenberg J1J_1J1​-J2J_2J2​ model. Compared to the existing method that combines the Lanczos method with the restricted Boltzmann machine, the primary advantage of the NQS Lanczos method is its linearly increasing computational cost.
Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.
Quantum many-body computation is a central challenge across multiple domains of scientific research, and Monte Carlo method has emerged as one of the most effective numerical techniques for investigating large-scale many-body systems. In recent years, the integration of Monte Carlo methods with machine learning has led to the development of neural quantum state approach. Quantum neural networks (QNNs) offer superior expressiveness compared to classical neural networks. In this paper, we propose a novel Quantum Neural Network Quantum State (QNNQS) method, based on the variational Monte Carlo framework. This approach leverages a quantum neural network to represent the many-body quantum state, and optimizes it iteratively through gradient descent to determine the ground-state energy. To assess the performance of this method, we conduct simulations of the one-dimensional transverse-field Ising model, investigating the influence of quantum circuit architecture on circuit expressibility, entangling capability, and computational accuracy. The results demonstrate that the QNNQS method achieves comparable simulation accuracy while utilizing significantly fewer parameters and requiring less training resources than classical network quantum state methods.
Neural-network quantum states (NQS) employ artificial neural networks to encode many-body wave functions in a second quantization through variational Monte Carlo (VMC). They have recently been applied to accurately describe electronic wave functions of molecules and have shown the challenges in efficiency compared with traditional quantum chemistry methods. Here, we introduce a general nonstochastic optimization algorithm for NQS in chemical systems, which deterministically generates a selected set of important configurations simultaneously with energy evaluation of NQS. This method bypasses the need for Markov-chain Monte Carlo within the VMC framework, thereby accelerating the entire optimization process. Furthermore, this newly developed nonstochastic optimization algorithm for NQS offers comparable or superior accuracy compared to its stochastic counterpart and ensures more stable convergence. The application of this model to test molecules exhibiting strong electron correlations provides further insight into the performance of NQS in chemical systems and opens avenues for future enhancements.
Neural-network quantum states (NQSs), variationally optimized by combining traditional methods and deep learning techniques, is a new way to find quantum many-body ground states and has gradually become a competitor of traditional variational methods. However, there are still some difficulties in the optimization of NQSs, such as local minima, slow convergence, and sign structure optimization. Here, we split a quantum many-body variational wave function into a multiplication of a real-valued amplitude neural network and a sign structure, and focus on the optimization of the amplitude network while keeping the sign structure fixed. The amplitude network is a convolutional neural network (CNN) with residual blocks, namely a residual network (ResNet). Our method is tested on three typical quantum many-body systems. The obtained ground state energies are better than or comparable to those from traditional variational Monte Carlo methods and density matrix renormalization group. Surprisingly, for the frustrated Heisenberg ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model, our results are better than those of the complex-valued CNN in the literature, implying that the sign structure of the complex-valued NQS is difficult to optimize. We will study the optimization of the sign structure of NQSs in the future.
Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods. Yet their optimization remains comparatively underexplored: Adam is a scalable method but ignores function space geometry, while stochastic reconfiguration is principled but costly and numerically fragile in large models. To address this gap, we show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution, motivating trust-region optimization for NQS training. We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel and phase increments in the phase channel. PWO avoids explicit matrix inversion, reuses samples across multiple updates, and combines the scalability of first-order optimization with theoretical guarantees. Across Ising and frustrated J1J_1J1​-J2J_2J2​ one- and two-dimensional spin systems, PWO improves stability and wall-clock convergence over Adam, minSR, and SPRING. Finally, we fine-tune a 1.51.51.5B-parameter RWKV-7 model, demonstrating NQS optimization at a scale over three orders of magnitude beyond prior work.