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:2411.03900 · Machine Learning Science and Technology

Retentive neural quantum states: efficient ansätze for ab initio quantum chemistry

Oliver Knitter, Dan Zhao, JAMES M. STOKES, Martin Ganahl, Stefan Leichenauer, Shravan Veerapaneni

Published Apr 10, 2025• 4 citations
arXivHTMLPDF

Abstract

Abstract Neural-network quantum states (NQS) has emerged as a powerful application of quantum-inspired deep learning for variational Monte Carlo methods, offering a competitive alternative to existing techniques for identifying ground states of quantum problems. A significant advancement toward improving the practical scalability of NQS has been the incorporation of autoregressive models, most recently transformers, as variational ansätze. Transformers learn sequence information with greater expressiveness than recurrent models, but at the cost of increased time complexity with respect to sequence length. We explore the use of the retentive network (RetNet), a recurrent alternative to transformers, as an ansatz for solving electronic ground state problems in ab initio quantum chemistry. Unlike transformers, RetNets overcome this time complexity bottleneck by processing data in parallel during training, and recurrently during inference. We give a simple computational cost estimate of the RetNet and directly compare it with similar estimates for transformers, establishing a clear threshold ratio of problem-to-model size past which the RetNet’s time complexity outperforms that of the transformer. Though this efficiency comes at the expense of decreased expressiveness relative to the transformer, we overcome this gap through training strategies that leverage the autoregressive structure of the model—namely, variational neural annealing. Our findings support the RetNet as a means of improving the time complexity of NQS without sacrificing accuracy. We provide further evidence that the ablative improvements of neural annealing extend beyond the RetNet architecture, suggesting it would serve as an effective general training strategy for autoregressive NQS.

DOI
10.1088/2632-2153/adcb88

Related papers

Exploration of Quantum-Inspired Deep Learning Architectures for Fundamental Applications in Scientific Computing

Oliver Knitter

Neural-network quantum states (NQS) is an exciting area of quantum-inspired machine learning, wherein a fully classical neural network is used to efficiently learn the optimal state vector for a quantum unsupervised learning problem, bypassing the need to model the full Hilbert space, which is exponentially large. In theory, NQS architectures are broadly applicable, and have been demonstrated successfully on several fundamental applications. We seek to further explore the practical utility of NQS as a black box solver for various applications in the scientific computing domain. We first present NQS as an explicit avenue for de-quantizing variational quantum eigensolvers, demonstrating with the variational quantum linear solver (VQLS). We then explore the utility of VQLS and its de-quantization, VNLS, as black box matrix inversion tools for a Newton-based linear complementarity solver, used to model the time evolution of a rudimentary granular medium. Turning our attention toward applications of NQS in quantum chemistry, we introduce a new retentive network (RetNet) autoregressive NQS ansatz to solve electronic ground state problems, and explore the incorporation of neural annealing techniques to these problems as a means of improving accuracy and ease of training. We finish with a rudimentary scaling law analysis of the RetNet architecture and its immediate autoregressive predecessors as applied to electronic structure calculations.

•Jan 1, 2024•0 citations

Parallel Scan Recurrent Neural Quantum States for Scalable Variational Monte Carlo

Ejaaz Merali, Mohamed Hibat-Allah, Mohammad Kohandel +2 more

Neural-network quantum states have emerged as a powerful variational framework for quantum many-body systems, with recent progress often driven by massively parallel architectures such as transformers. Recurrent neural network quantum states, however, are frequently regarded as intrinsically sequential and therefore less scalable. Here we revisit this view by showing that modern recurrent architectures can support fast, accurate, and computationally accessible neural quantum state simulations. Using autoregressive recurrent wave functions together with recent advances in parallelizable recurrence, we develop variational ansätze, called parallel scan recurrent neural quantum states (PSR-NQS), which can be trained efficiently within variational Monte Carlo in one and two spatial dimensions. We demonstrate accurate benchmark results and show that, with iterative retraining, our approach reaches two-dimensional spin lattices as large as $52\times52$ while remaining in agreement with available quantum Monte Carlo data. Our results establish recurrent architectures as a practical and promising route toward scalable neural quantum state simulations with modest computational resources.

cond-mat.str-elCross-listedarXiv:2605.13807•May 14, 2026•4 citations

NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry

Yangjun Wu, Chu Guo, Yi Fan +2 more

Neural network quantum state (NNQS) has emerged as a promising candidate for quantum many-body problems, but its practical applications are often hindered by the high cost of sampling and local energy calculation. We develop a high-performance NNQS method for ab initio electronic structure calculations. The major innovations include: (1) A transformer based architecture as the quantum wave function ansatz; (2) A data-centric parallelization scheme for the variational Monte Carlo (VMC) algorithm which preserves data locality and well adapts for different computing architectures; (3) A parallel batch sampling strategy which reduces the sampling cost and achieves good load balance; (4) A parallel local energy evaluation scheme which is both memory and computationally efficient; (5) Study of real chemical systems demonstrates both the superior accuracy of our method compared to state-of-the-art and the strong and weak scalability for large molecular systems with up to 120 spin orbitals.

arXiv:2306.16705•International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Oct 30, 2023•37 citations

Hybrid Tensor Network and Neural Network Quantum States for Quantum Chemistry

Zibo Wu, Bohan Zhang, Wei‐Hai Fang +1 more

Neural network quantum states (NQS) have emerged as a powerful and flexible framework for addressing quantum many-body problems. While successful for model Hamiltonians, their application to molecular systems remains challenging for several reasons. In this work, we introduce three innovations to overcome some of the key limitations. (1) We develop a bounded-degree graph recurrent neural network (BDG–RNN) ansatz, which hybridizes the tensor network and neural network states and is more suitable to molecular electronic structure problems. As matrix product states (MPS) can be embedded into this ansatz, good initialization is possible for complex systems. (2) We introduce neural network correlators (NNCs) to further enhance expressivity and improve accuracy, without dramatically modifying the underlying variational Monte Carlo (VMC) optimization framework. Specifically, we introduce two types of restricted Boltzmann machine (RBM)-inspired correlators, namely, cos-RBM and Ising-RBM, which unlike previous correlators, such as Jastrow and real RBM, can adjust the sign structure of the wave function. (3) We introduce a semistochastic algorithm for local energy evaluation, which significantly reduces computational cost while maintaining high accuracy. Combining these advances, we demonstrate that our approaches can achieve chemical accuracy in challenging systems, including the one-dimensional hydrogen chain H 50, the iron–sulfur cluster [Fe 2 S 2 (SCH 3 ) 4 ] 2–, and a three-dimensional 3 × 3 × 2 hydrogen cluster H 18 . These methods are implemented in an open-source package, P y NQS ( https://github.com/Quantum-Chemistry-Group-BNU/PyNQS ), to advance NQS methodologies for quantum chemistry.

arXiv:2507.19276•Journal of Chemical Theory and Computation•Oct 9, 2025•4 citations

Quantum Computing and Artificial Neural Network methods in approximating the Quantum Many-Body Fermion System for Modern Quantum Chemistry Applications

Chengze Yang

The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. Approximation methods have been developed, ranging from the widely used Density Functional Theory (DFT) to Coupled Cluster (CC) theory. While powerful, these conventional approaches often involve controlled truncations which caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the transferability. Recent research demonstrates that with carefully designed architectures, ANNs can not only represent ground states of model systems with high precision but also tackle the sign problem, offering a promising path forward for strongly correlated electronic structure calculations.2,3 This review charts the paradigm shift driven by Neural Network Quantum States (NNQS), which leverage the representational power of deep learning to overcome these barriers. We detail the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.

•Nov 11, 2025•0 citations

Quantum Computing and Artificial Neural Network methods in approximating the Quantum Many-Body Fermion System for Modern Quantum Chemistry Applications

Chengze Yang

The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. Approximation methods have been developed, ranging from the widely used Density Functional Theory (DFT) to Coupled Cluster (CC) theory. While powerful, these conventional approaches often involve controlled truncations which caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the transferability. Recent research demonstrates that with carefully designed architectures, ANNs can not only represent ground states of model systems with high precision but also tackle the sign problem, offering a promising path forward for strongly correlated electronic structure calculations.2,3 This review charts the paradigm shift driven by Neural Network Quantum States (NNQS), which leverage the representational power of deep learning to overcome these barriers. We detail the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.

•Nov 21, 2025•0 citations
Abstract Neural-network quantum states (NQS) has emerged as a powerful application of quantum-inspired deep learning for variational Monte Carlo methods, offering a competitive alternative to existing techniques for identifying ground states of quantum problems. A significant advancement toward improving the practical scalability of NQS has been the incorporation of autoregressive models, most recently transformers, as variational ansätze. Transformers learn sequence information with greater expressiveness than recurrent models, but at the cost of increased time complexity with respect to sequence length. We explore the use of the retentive network (RetNet), a recurrent alternative to transformers, as an ansatz for solving electronic ground state problems in ab initio quantum chemistry. Unlike transformers, RetNets overcome this time complexity bottleneck by processing data in parallel during training, and recurrently during inference. We give a simple computational cost estimate of the RetNet and directly compare it with similar estimates for transformers, establishing a clear threshold ratio of problem-to-model size past which the RetNet’s time complexity outperforms that of the transformer. Though this efficiency comes at the expense of decreased expressiveness relative to the transformer, we overcome this gap through training strategies that leverage the autoregressive structure of the model—namely, variational neural annealing. Our findings support the RetNet as a means of improving the time complexity of NQS without sacrificing accuracy. We provide further evidence that the ablative improvements of neural annealing extend beyond the RetNet architecture, suggesting it would serve as an effective general training strategy for autoregressive NQS.
Neural-network quantum states (NQS) is an exciting area of quantum-inspired machine learning, wherein a fully classical neural network is used to efficiently learn the optimal state vector for a quantum unsupervised learning problem, bypassing the need to model the full Hilbert space, which is exponentially large. In theory, NQS architectures are broadly applicable, and have been demonstrated successfully on several fundamental applications. We seek to further explore the practical utility of NQS as a black box solver for various applications in the scientific computing domain. We first present NQS as an explicit avenue for de-quantizing variational quantum eigensolvers, demonstrating with the variational quantum linear solver (VQLS). We then explore the utility of VQLS and its de-quantization, VNLS, as black box matrix inversion tools for a Newton-based linear complementarity solver, used to model the time evolution of a rudimentary granular medium. Turning our attention toward applications of NQS in quantum chemistry, we introduce a new retentive network (RetNet) autoregressive NQS ansatz to solve electronic ground state problems, and explore the incorporation of neural annealing techniques to these problems as a means of improving accuracy and ease of training. We finish with a rudimentary scaling law analysis of the RetNet architecture and its immediate autoregressive predecessors as applied to electronic structure calculations.
Neural-network quantum states have emerged as a powerful variational framework for quantum many-body systems, with recent progress often driven by massively parallel architectures such as transformers. Recurrent neural network quantum states, however, are frequently regarded as intrinsically sequential and therefore less scalable. Here we revisit this view by showing that modern recurrent architectures can support fast, accurate, and computationally accessible neural quantum state simulations. Using autoregressive recurrent wave functions together with recent advances in parallelizable recurrence, we develop variational ansätze, called parallel scan recurrent neural quantum states (PSR-NQS), which can be trained efficiently within variational Monte Carlo in one and two spatial dimensions. We demonstrate accurate benchmark results and show that, with iterative retraining, our approach reaches two-dimensional spin lattices as large as 52×5252\times5252×52 while remaining in agreement with available quantum Monte Carlo data. Our results establish recurrent architectures as a practical and promising route toward scalable neural quantum state simulations with modest computational resources.
Neural network quantum state (NNQS) has emerged as a promising candidate for quantum many-body problems, but its practical applications are often hindered by the high cost of sampling and local energy calculation. We develop a high-performance NNQS method for ab initio electronic structure calculations. The major innovations include: (1) A transformer based architecture as the quantum wave function ansatz; (2) A data-centric parallelization scheme for the variational Monte Carlo (VMC) algorithm which preserves data locality and well adapts for different computing architectures; (3) A parallel batch sampling strategy which reduces the sampling cost and achieves good load balance; (4) A parallel local energy evaluation scheme which is both memory and computationally efficient; (5) Study of real chemical systems demonstrates both the superior accuracy of our method compared to state-of-the-art and the strong and weak scalability for large molecular systems with up to 120 spin orbitals.
Neural network quantum states (NQS) have emerged as a powerful and flexible framework for addressing quantum many-body problems. While successful for model Hamiltonians, their application to molecular systems remains challenging for several reasons. In this work, we introduce three innovations to overcome some of the key limitations. (1) We develop a bounded-degree graph recurrent neural network (BDG–RNN) ansatz, which hybridizes the tensor network and neural network states and is more suitable to molecular electronic structure problems. As matrix product states (MPS) can be embedded into this ansatz, good initialization is possible for complex systems. (2) We introduce neural network correlators (NNCs) to further enhance expressivity and improve accuracy, without dramatically modifying the underlying variational Monte Carlo (VMC) optimization framework. Specifically, we introduce two types of restricted Boltzmann machine (RBM)-inspired correlators, namely, cos-RBM and Ising-RBM, which unlike previous correlators, such as Jastrow and real RBM, can adjust the sign structure of the wave function. (3) We introduce a semistochastic algorithm for local energy evaluation, which significantly reduces computational cost while maintaining high accuracy. Combining these advances, we demonstrate that our approaches can achieve chemical accuracy in challenging systems, including the one-dimensional hydrogen chain H 50, the iron–sulfur cluster [Fe 2 S 2 (SCH 3 ) 4 ] 2–, and a three-dimensional 3 × 3 × 2 hydrogen cluster H 18 . These methods are implemented in an open-source package, P y NQS ( https://github.com/Quantum-Chemistry-Group-BNU/PyNQS ), to advance NQS methodologies for quantum chemistry.
The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. Approximation methods have been developed, ranging from the widely used Density Functional Theory (DFT) to Coupled Cluster (CC) theory. While powerful, these conventional approaches often involve controlled truncations which caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the transferability. Recent research demonstrates that with carefully designed architectures, ANNs can not only represent ground states of model systems with high precision but also tackle the sign problem, offering a promising path forward for strongly correlated electronic structure calculations.2,3 This review charts the paradigm shift driven by Neural Network Quantum States (NNQS), which leverage the representational power of deep learning to overcome these barriers. We detail the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.
The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. Approximation methods have been developed, ranging from the widely used Density Functional Theory (DFT) to Coupled Cluster (CC) theory. While powerful, these conventional approaches often involve controlled truncations which caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the transferability. Recent research demonstrates that with carefully designed architectures, ANNs can not only represent ground states of model systems with high precision but also tackle the sign problem, offering a promising path forward for strongly correlated electronic structure calculations.2,3 This review charts the paradigm shift driven by Neural Network Quantum States (NNQS), which leverage the representational power of deep learning to overcome these barriers. We detail the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.