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

Precision Chemistry

Implicitly Restarted Lanczos Enables Chemically Accurate Shallow Neural Quantum States

Wei Liu, Wenjie Dou

Published Mar 30, 2026• 1 citation
Publisher

Abstract

Abstract The variational optimization of neural quantum states (NQS) is hindered by the slow convergence and numerical instability of conventional optimizers. We address this bottleneck by introducing the implicitly restarted Lanczos (IRL) method as the core engine for NQS training. Our approach recasts the parameter update problem into a Hermitian eigenvalue problem that IRL solves efficiently, automatically determining the optimal descent direction and step size without hyperparameter tuning. We demonstrate that IRL enables shallow NQS architectures to achieve extreme precision in just 3–5 optimization steps, dramatically outperforming existing methods, including minimum-step stochastic reconfiguration (MinSR). For the N2 dissociation curve, IRL successfully trains a shallow NQS to match full configuration interaction accuracy, validating its robust convergence in strongly correlated regimes. This work establishes IRL as an efficient and robust second-order optimization strategy for variational quantum models.

DOI
10.1021/prechem.5c00445

Related papers

Implicitly Restarted Lanczos Enables Chemically-Accurate Shallow Neural Quantum States

Wei Liu, Wenjie Dou

The variational optimization of high-dimensional neural network models, such as those used in neural quantum states (NQS), presents a significant challenge in machine intelligence. Conventional first-order stochastic methods (e.g., Adam) are plagued by slow convergence, sensitivity to hyperparameters, and numerical instability, preventing NQS from reaching the high accuracy required for fundamental science. We address this fundamental optimization bottleneck by introducing the implicitly restarted Lanczos (IRL) method as the core engine for NQS training. Our key innovation is an inherently stable second-order optimization framework that recasts the ill-conditioned parameter update problem into a small, well-posed Hermitian eigenvalue problem. By solving this problem efficiently and robustly with IRL, our approach automatically determines the optimal descent direction and step size, circumventing the need for demanding hyperparameter tuning and eliminating the numerical instabilities common in standard iterative solvers. We demonstrate that IRL enables shallow NQS architectures (with orders of magnitude fewer parameters) to consistently achieve extreme precision (1e-12 kcal/mol) in just 3 to 5 optimization steps. For the F2 molecule, this translates to an approximate 17,900-fold speed-up in total runtime compared to Adam. This work establishes IRL as a superior, robust, and efficient second-order optimization strategy for variational quantum models, paving the way for the practical, high-fidelity application of neural networks in quantum physics and chemistry.

quant-pharXiv:2601.01437•Jan 6, 2026•0 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•0 citations

Empowering deep neural quantum states through efficient optimization

Ao Chen, Markus Heyl

Abstract Computing the ground state of interacting quantum matter is a long-standing challenge, especially for complex two-dimensional systems. Recent developments have highlighted the potential of neural quantum states to solve the quantum many-body problem by encoding the many-body wavefunction into artificial neural networks. However, this method has faced the critical limitation that existing optimization algorithms are not suitable for training modern large-scale deep network architectures. Here, we introduce a minimum-step stochastic-reconfiguration optimization algorithm, which allows us to train deep neural quantum states with up to 10 6 parameters. We demonstrate our method for paradigmatic frustrated spin-1/2 models on square and triangular lattices, for which our trained deep networks approach machine precision and yield improved variational energies compared to existing results. Equipped with our optimization algorithm, we find numerical evidence for gapless quantum-spin-liquid phases in the considered models, an open question to date. We present a method that captures the emergent complexity in quantum many-body problems through the expressive power of large-scale artificial neural networks.

arXiv:2302.01941•Nature Physics•Jul 1, 2024•88 citations

A Deterministic Framework for Neural Network Quantum States in Quantum Chemistry

Zheng Che

We present a deterministic optimization framework for Neural Network Quantum States (NQS) designed to bypass the sampling variance and slow mixing issues inherent in stochastic optimization. By projecting a neural backflow ansatz onto dynamically evolving configuration subspaces and applying a post-hoc second-order perturbative correction, our method provides a systematic route for optimizing the selected variational component of the wavefunction and estimating residual correlation through a post-hoc perturbative correction. The implementation utilizes a hybrid CPU-GPU architecture that shows empirical sub-linear wall-time scaling with respect to the subspace size over the tested range, enabling the calculation of strongly correlated systems, such as the chromium dimer, within Hilbert spaces of $10^{23}$ configurations. Benchmarks on molecular bond dissociations demonstrate that this deterministic approach yields stable convergence and accuracies comparable to selected reference methods in the tested systems.

physics.chem-phCross-listedarXiv:2601.21310•Journal of Chemical Theory and Computation•Jan 30, 2026•1 citation

A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions

Gil Goldshlager, Nilin Abrahamsen, Lin Lin

Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents their application to larger systems. We propose the Subsampled Projected-Increment Natural Gradient Descent (SPRING) optimizer to reduce this bottleneck. SPRING combines ideas from the recently introduced minimum-step stochastic reconfiguration optimizer (MinSR) and the classical randomized Kaczmarz method for solving linear least-squares problems. We demonstrate that SPRING outperforms both MinSR and the popular Kronecker-Factored Approximate Curvature method (KFAC) across a number of small atoms and molecules, given that the learning rates of all methods are optimally tuned. For example, on the oxygen atom, SPRING attains chemical accuracy after forty thousand training iterations, whereas both MinSR and KFAC fail to do so even after one hundred thousand iterations.

arXiv:2401.10190•Journal of Computational Physics•Aug 22, 2024•21 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•16 citations
Abstract The variational optimization of neural quantum states (NQS) is hindered by the slow convergence and numerical instability of conventional optimizers. We address this bottleneck by introducing the implicitly restarted Lanczos (IRL) method as the core engine for NQS training. Our approach recasts the parameter update problem into a Hermitian eigenvalue problem that IRL solves efficiently, automatically determining the optimal descent direction and step size without hyperparameter tuning. We demonstrate that IRL enables shallow NQS architectures to achieve extreme precision in just 3–5 optimization steps, dramatically outperforming existing methods, including minimum-step stochastic reconfiguration (MinSR). For the N2 dissociation curve, IRL successfully trains a shallow NQS to match full configuration interaction accuracy, validating its robust convergence in strongly correlated regimes. This work establishes IRL as an efficient and robust second-order optimization strategy for variational quantum models.
The variational optimization of high-dimensional neural network models, such as those used in neural quantum states (NQS), presents a significant challenge in machine intelligence. Conventional first-order stochastic methods (e.g., Adam) are plagued by slow convergence, sensitivity to hyperparameters, and numerical instability, preventing NQS from reaching the high accuracy required for fundamental science. We address this fundamental optimization bottleneck by introducing the implicitly restarted Lanczos (IRL) method as the core engine for NQS training. Our key innovation is an inherently stable second-order optimization framework that recasts the ill-conditioned parameter update problem into a small, well-posed Hermitian eigenvalue problem. By solving this problem efficiently and robustly with IRL, our approach automatically determines the optimal descent direction and step size, circumventing the need for demanding hyperparameter tuning and eliminating the numerical instabilities common in standard iterative solvers. We demonstrate that IRL enables shallow NQS architectures (with orders of magnitude fewer parameters) to consistently achieve extreme precision (1e-12 kcal/mol) in just 3 to 5 optimization steps. For the F2 molecule, this translates to an approximate 17,900-fold speed-up in total runtime compared to Adam. This work establishes IRL as a superior, robust, and efficient second-order optimization strategy for variational quantum models, paving the way for the practical, high-fidelity application of neural networks in quantum physics and chemistry.
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.
Abstract Computing the ground state of interacting quantum matter is a long-standing challenge, especially for complex two-dimensional systems. Recent developments have highlighted the potential of neural quantum states to solve the quantum many-body problem by encoding the many-body wavefunction into artificial neural networks. However, this method has faced the critical limitation that existing optimization algorithms are not suitable for training modern large-scale deep network architectures. Here, we introduce a minimum-step stochastic-reconfiguration optimization algorithm, which allows us to train deep neural quantum states with up to 10 6 parameters. We demonstrate our method for paradigmatic frustrated spin-1/2 models on square and triangular lattices, for which our trained deep networks approach machine precision and yield improved variational energies compared to existing results. Equipped with our optimization algorithm, we find numerical evidence for gapless quantum-spin-liquid phases in the considered models, an open question to date. We present a method that captures the emergent complexity in quantum many-body problems through the expressive power of large-scale artificial neural networks.
We present a deterministic optimization framework for Neural Network Quantum States (NQS) designed to bypass the sampling variance and slow mixing issues inherent in stochastic optimization. By projecting a neural backflow ansatz onto dynamically evolving configuration subspaces and applying a post-hoc second-order perturbative correction, our method provides a systematic route for optimizing the selected variational component of the wavefunction and estimating residual correlation through a post-hoc perturbative correction. The implementation utilizes a hybrid CPU-GPU architecture that shows empirical sub-linear wall-time scaling with respect to the subspace size over the tested range, enabling the calculation of strongly correlated systems, such as the chromium dimer, within Hilbert spaces of 102310^{23}1023 configurations. Benchmarks on molecular bond dissociations demonstrate that this deterministic approach yields stable convergence and accuracies comparable to selected reference methods in the tested systems.
Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents their application to larger systems. We propose the Subsampled Projected-Increment Natural Gradient Descent (SPRING) optimizer to reduce this bottleneck. SPRING combines ideas from the recently introduced minimum-step stochastic reconfiguration optimizer (MinSR) and the classical randomized Kaczmarz method for solving linear least-squares problems. We demonstrate that SPRING outperforms both MinSR and the popular Kronecker-Factored Approximate Curvature method (KFAC) across a number of small atoms and molecules, given that the learning rates of all methods are optimally tuned. For example, on the oxygen atom, SPRING attains chemical accuracy after forty thousand training iterations, whereas both MinSR and KFAC fail to do so even after one hundred thousand iterations.
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.