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:2410.23018 · Physical review. E

Optimizing temperature distributions for training neural quantum states using parallel tempering

Conor Smith, Quinn Campbell, Tameem Albash

Published May 22, 2025• 0 citations
arXivHTMLPDF

Abstract

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the J_{1}-J_{2} model on a rectangular lattice.

DOI
10.1103/physreve.111.055306

Related papers

Quantum-inspired tempering for ground state approximation using artificial neural networks

Tameem Albash, Conor Smith, Quinn Campbell +1 more

A large body of work has demonstrated that parameterized artificial neural networks (ANNs) can efficiently describe ground states of numerous interesting quantum many-body Hamiltonians. However, the standard variational algorithms used to update or train the ANN parameters can get trapped in local minima, especially for frustrated systems and even if the representation is sufficiently expressive. We propose a parallel tempering method that facilitates escape from such local minima. This methods involves training multiple ANNs independently, with each simulation governed by a Hamiltonian with a different "driver" strength, in analogy to quantum parallel tempering, and it incorporates an update step into the training that allows for the exchange of neighboring ANN configurations. We study instances from two classes of Hamiltonians to demonstrate the utility of our approach using Restricted Boltzmann Machines as our parameterized ANN. The first instance is based on a permutation-invariant Hamiltonian whose landscape stymies the standard training algorithm by drawing it increasingly to a false local minimum. The second instance is four hydrogen atoms arranged in a rectangle, which is an instance of the second quantized electronic structure Hamiltonian discretized using Gaussian basis functions. We study this problem in a minimal basis set, which exhibits false minima that can trap the standard variational algorithm despite the problem’s small size. We show that augmenting the training with quantum parallel tempering becomes useful to finding good approximations to the ground states of these problem instances.

arXiv:2210.11405•SciPost Physics•May 19, 2023•1 citation

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•155 citations

Variational neural and tensor network approximations of thermal states

Sirui Lu, Giacomo Giudice, J. I. Cirac

We introduce a variational Monte Carlo algorithm for approximating finite-temperature quantum many-body systems, based on the minimization of a modified free energy. This approach directly approximates the state at a fixed temperature, allowing for systematic improvement of the expressiveness without accumulating errors from iterative imaginary-time evolution. We employ a variety of trial states—both tensor networks as well as neural networks—as variational for our numerical optimization. We benchmark and compare different constructions in the above classes, both for one- and two-dimensional problems, with systems made of up to N = 100 spins. Our results demonstrate that while restricted Boltzmann machines show limitations, string bond tensor network states exhibit systematic improvements with increasing bond dimensions and the number of strings.

arXiv:2401.14243•Physical review. B./Physical review. B•Feb 3, 2025•11 citations

Adaptive neural quantum states: a recurrent neural network perspective

Jake McNaughton, Mohamed Hibat-Allah

Abstract Neural-network quantum states (NQS) are powerful neural-network ansätzes that have emerged as promising tools for studying quantum many-body physics through the lens of the variational principle. These architectures are known to be systematically improvable by increasing the number of parameters. Here we demonstrate an Adaptive scheme to optimize NQSs, through the example of recurrent neural networks (RNNs), using a fraction of the computation cost while reducing training fluctuations and improving the quality of variational calculations targeting ground states of prototypical models in one- and two-spatial dimensions. This Adaptive framework reduces the computational cost through training small RNNs and reusing them to initialize larger RNNs. This work opens up the possibility for optimizing graphical processing unit resources deployed in large-scale NQS simulations.

arXiv:2507.18700•Machine Learning Science and Technology•Sep 15, 2026•4 citations

Continuous-time parametrization of neural quantum states for quantum dynamics

Dingzu Wang, Wenxuan Zhang, Xiansong Xu +1 more

Neural quantum states are a promising framework for simulating many-body quantum dynamics, as they can represent states with volume-law entanglement. As time evolves, the neural network parameters are typically optimized at discrete time steps to approximate the wave function at each point in time. Given the differentiability of the wave function stemming from the Schrödinger equation, here we impose a time-continuous and differentiable parameterization of the neural network by expressing its parameters as linear combinations of temporal basis functions with trainable, time-independent coefficients. We test this ansatz, referred to as the smooth neural quantum state (\textit{s}-NQS) with a loss function defined over an extended time interval, under a sudden quench of a non-integrable many-body quantum spin chain. We demonstrate accurate time evolution using a restricted Boltzmann machine as the instantaneous neural network architecture. We show that the parameterization enables accurate simulations with fewer variational parameters, independent of time-step resolution. Furthermore, the smooth neural quantum state also allows us to initialize and evaluate the wave function at times not included in the training set, both within and beyond the training interval.

arXiv:2507.08418•Jul 11, 2025•3 citations

Quantum-Inspired Optimization of Neural Network Training Dynamics

Jincheng Zhang

Training deep neural networks remains a computationally intensive and often challenging process. Traditional optimization methods, such as stochastic gradient descent (SGD) and its variants, frequently struggle to escape local minima and converge to optimal solutions, leading to suboptimal network performance. This paper proposes a novel approach to neural network training that leverages principles inspired by quantum mechanics. Specifically, we investigate the application of quantum-inspired optimization techniques, including simulated annealing and quantum walks, to dynamically adjust the training process. The core idea is to mimic the probabilistic exploration inherent in quantum systems to effectively navigate the complex loss landscape of neural networks. We formulate the training process as a quantum-inspired optimization problem, where the network's weights are treated as quantum bits (Qubits) and the optimization algorithm seeks to find the lowest energy state, analogous to finding the minimum loss. The proposed method demonstrates the potential for accelerating convergence and improving the overall accuracy of neural networks compared to conventional optimization strategies. Our analysis focuses on the key aspects of the approach, including the mathematical formulation of the quantum-inspired optimization problem and the selection of appropriate parameters to govern the exploration and exploitation phases. We present a theoretical framework for understanding the dynamics of this approach and discuss potential avenues for further research, including hybrid quantum-classical algorithms and the integration of quantum computing hardware.

•Sep 5, 2026•0 citations
Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the J_{1}-J_{2} model on a rectangular lattice.
A large body of work has demonstrated that parameterized artificial neural networks (ANNs) can efficiently describe ground states of numerous interesting quantum many-body Hamiltonians. However, the standard variational algorithms used to update or train the ANN parameters can get trapped in local minima, especially for frustrated systems and even if the representation is sufficiently expressive. We propose a parallel tempering method that facilitates escape from such local minima. This methods involves training multiple ANNs independently, with each simulation governed by a Hamiltonian with a different "driver" strength, in analogy to quantum parallel tempering, and it incorporates an update step into the training that allows for the exchange of neighboring ANN configurations. We study instances from two classes of Hamiltonians to demonstrate the utility of our approach using Restricted Boltzmann Machines as our parameterized ANN. The first instance is based on a permutation-invariant Hamiltonian whose landscape stymies the standard training algorithm by drawing it increasingly to a false local minimum. The second instance is four hydrogen atoms arranged in a rectangle, which is an instance of the second quantized electronic structure Hamiltonian discretized using Gaussian basis functions. We study this problem in a minimal basis set, which exhibits false minima that can trap the standard variational algorithm despite the problem’s small size. We show that augmenting the training with quantum parallel tempering becomes useful to finding good approximations to the ground states of these problem instances.
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 introduce a variational Monte Carlo algorithm for approximating finite-temperature quantum many-body systems, based on the minimization of a modified free energy. This approach directly approximates the state at a fixed temperature, allowing for systematic improvement of the expressiveness without accumulating errors from iterative imaginary-time evolution. We employ a variety of trial states—both tensor networks as well as neural networks—as variational for our numerical optimization. We benchmark and compare different constructions in the above classes, both for one- and two-dimensional problems, with systems made of up to N = 100 spins. Our results demonstrate that while restricted Boltzmann machines show limitations, string bond tensor network states exhibit systematic improvements with increasing bond dimensions and the number of strings.
Abstract Neural-network quantum states (NQS) are powerful neural-network ansätzes that have emerged as promising tools for studying quantum many-body physics through the lens of the variational principle. These architectures are known to be systematically improvable by increasing the number of parameters. Here we demonstrate an Adaptive scheme to optimize NQSs, through the example of recurrent neural networks (RNNs), using a fraction of the computation cost while reducing training fluctuations and improving the quality of variational calculations targeting ground states of prototypical models in one- and two-spatial dimensions. This Adaptive framework reduces the computational cost through training small RNNs and reusing them to initialize larger RNNs. This work opens up the possibility for optimizing graphical processing unit resources deployed in large-scale NQS simulations.
Neural quantum states are a promising framework for simulating many-body quantum dynamics, as they can represent states with volume-law entanglement. As time evolves, the neural network parameters are typically optimized at discrete time steps to approximate the wave function at each point in time. Given the differentiability of the wave function stemming from the Schrödinger equation, here we impose a time-continuous and differentiable parameterization of the neural network by expressing its parameters as linear combinations of temporal basis functions with trainable, time-independent coefficients. We test this ansatz, referred to as the smooth neural quantum state (\textit{s}-NQS) with a loss function defined over an extended time interval, under a sudden quench of a non-integrable many-body quantum spin chain. We demonstrate accurate time evolution using a restricted Boltzmann machine as the instantaneous neural network architecture. We show that the parameterization enables accurate simulations with fewer variational parameters, independent of time-step resolution. Furthermore, the smooth neural quantum state also allows us to initialize and evaluate the wave function at times not included in the training set, both within and beyond the training interval.
Training deep neural networks remains a computationally intensive and often challenging process. Traditional optimization methods, such as stochastic gradient descent (SGD) and its variants, frequently struggle to escape local minima and converge to optimal solutions, leading to suboptimal network performance. This paper proposes a novel approach to neural network training that leverages principles inspired by quantum mechanics. Specifically, we investigate the application of quantum-inspired optimization techniques, including simulated annealing and quantum walks, to dynamically adjust the training process. The core idea is to mimic the probabilistic exploration inherent in quantum systems to effectively navigate the complex loss landscape of neural networks. We formulate the training process as a quantum-inspired optimization problem, where the network's weights are treated as quantum bits (Qubits) and the optimization algorithm seeks to find the lowest energy state, analogous to finding the minimum loss. The proposed method demonstrates the potential for accelerating convergence and improving the overall accuracy of neural networks compared to conventional optimization strategies. Our analysis focuses on the key aspects of the approach, including the mathematical formulation of the quantum-inspired optimization problem and the selection of appropriate parameters to govern the exploration and exploitation phases. We present a theoretical framework for understanding the dynamics of this approach and discuss potential avenues for further research, including hybrid quantum-classical algorithms and the integration of quantum computing hardware.