In recent years, generative artificial neural networks based on restricted Boltzmann machines (RBMs) have been successfully employed as accurate and flexible variational wave functions for clean quantum many-body systems. In this article, we explore their use in simulations of disordered quantum Ising chains. The standard dense RBM with all-to-all interlayer connectivity is not particularly appropriate for large disordered systems, since in such systems one cannot exploit translational invariance to reduce the amount of parameters to be optimized. To circumvent this problem, we implement sparse RBMs, whereby the visible spins are connected only to a subset of local hidden neurons, thus reducing the amount of parameters. We assess the performance of sparse RBMs as a function of the range of the allowed connections, and we compare it with that of dense RBMs. Benchmark results are provided for two sign-problem-free Hamiltonians, namely pure and random quantum Ising chains. The RBM Ansätzes are trained using the unsupervised learning scheme based on projective quantum Monte Carlo (PQMC) algorithms. We find that the sparse connectivity facilitates the training process and allows sparse RBMs to outperform their dense counterparts. Furthermore, the use of sparse RBMs as guiding functions for PQMC simulations allows us to perform PQMC simulations at a reduced computational cost, avoiding possible biases due to finite random-walker populations. We obtain unbiased predictions for the ground-state energies and the magnetization profiles with fixed boundary conditions, at the ferromagnetic quantum critical point. The magnetization profiles agree with the Fisher-de Gennes scaling relation for conformally invariant systems, including the scaling dimension predicted by the renormalization-group analysis.
In recent years, generative artificial neural networks based on restricted Boltzmann machines (RBMs) have been successfully employed as accurate and flexible variational wave functions for clean quantum many-body systems. In this article, we explore their use in simulations of disordered quantum Ising chains. The standard dense RBM with all-to-all interlayer connectivity is not particularly appropriate for large disordered systems, since in such systems one cannot exploit translational invariance to reduce the amount of parameters to be optimized. To circumvent this problem, we implement sparse RBMs, whereby the visible spins are connected only to a subset of local hidden neurons, thus reducing the amount of parameters. We assess the performance of sparse RBMs as a function of the range of the allowed connections, and we compare it with that of dense RBMs. Benchmark results are provided for two sign-problem-free Hamiltonians, namely pure and random quantum Ising chains. The RBM Ansätzes are trained using the unsupervised learning scheme based on projective quantum Monte Carlo (PQMC) algorithms. We find that the sparse connectivity facilitates the training process and allows sparse RBMs to outperform their dense counterparts. Furthermore, the use of sparse RBMs as guiding functions for PQMC simulations allows us to perform PQMC simulations at a reduced computational cost, avoiding possible biases due to finite random-walker populations. We obtain unbiased predictions for the ground-state energies and the magnetization profiles with fixed boundary conditions, at the ferromagnetic quantum critical point. The magnetization profiles agree with the Fisher-de Gennes scaling relation for conformally invariant systems, including the scaling dimension predicted by the renormalization-group analysis.
We investigate the use of variational wave functions that mimic stochastic recurrent neural networks, specifically, unrestricted Boltzmann machines, as guiding functions in projective quantum Monte Carlo (PQMC) simulations of quantum spin models. As a preliminary step, we investigate the accuracy of such unrestricted neural network states as variational Ans\"atze for the ground state of the ferromagnetic quantum Ising chain. We find that by optimizing just three variational parameters, independently on the system size, accurate ground-state energies are obtained, comparable to those previously obtained using restricted Boltzmann machines with few variational parameters per spin. Chiefly, we show that if one uses optimized unrestricted neural network states as guiding functions for importance sampling, the efficiency of the PQMC algorithms is greatly enhanced, drastically reducing the most relevant systematic bias, namely, the one due to the finite random-walker population. The scaling of the computational cost with the system size changes from the exponential scaling characteristic of PQMC simulations performed without importance sampling, to a polynomial scaling, apparently even at the ferromagnetic quantum critical point. The important role of the protocol chosen to sample hidden-spin configurations, in particular at the critical point, is analyzed. We discuss the implications of these findings for what concerns the problem of simulating adiabatic quantum optimization using stochastic algorithms on classical computers.
The projective quantum Monte Carlo (PQMC) algorithms are among the most powerful computational techniques to simulate the ground-state properties of quantum many-body systems. However, they are efficient only if a sufficiently accurate trial wave function is used to guide the simulation. In the standard approach, this guiding wave function is obtained in a separate simulation that performs a variational minimization. Here we show how to perform PQMC simulations guided by an adaptive wave function based on a restricted Boltzmann machine. This adaptive wave function is optimized along the PQMC simulation via unsupervised machine learning, avoiding the need of a separate variational optimization. As a byproduct, this technique provides an accurate ansatz for the ground-state wave function, which is obtained by minimizing the Kullback-Leibler divergence with respect to the PQMC samples, rather than by minimizing the energy expectation value as in standard variational optimizations. The high accuracy of this self-learning PQMC technique is demonstrated for a paradigmatic sign-problem-free model, namely, the ferromagnetic quantum Ising chain, showing very precise agreement with the predictions of the Jordan-Wigner theory and of loop quantum Monte Carlo simulations performed in the low-temperature limit.
The simulation of interacting many-body quantum systems is a central chal- lenge in condensed matter physics due to the exponential growth of the Hilbert space with system size. In this project, we implement a Neural Network Quantum State (NQS) ansatz based on a Complex Restricted Boltzmann Machine (RBM) to solve for the ground state of the 1D Transverse Field Ising Model (TFIM). Using Variational Monte Carlo (VMC) optimization via Stochastic Reconfiguration (SR), we successfully train the network to approximate the ground state wave function across the paramagnetic-ferromagnetic phase transition. We benchmark our results against Exact Diagonalization (ED) for small systems (N = 12), demonstrating high accuracy in ground state energy estimation. Furthermore, we investigate quantum correlations and order parameters, specifically the transverse magnetization mx and longitudinal spin-spin correlations Czz(r), highlighting the RBM’s ability to capture long-range order and critical behavior near the quantum critical point hx/J = 1.
Accuracy of restricted Boltzmann machines for the one-dimensional J1−J2 Heisenberg model
Neural networks have been recently proposed as variational wave functions for quantum many-body systems [G. Carleo and M. Troyer, Science 355, 602 (2017)]. In this work, we focus on a specific architecture, known as Restricted Boltzmann Machine (RBM), and analyse its accuracy for the spin-1/2 J1−J2 antiferromagnetic Heisenberg model in one spatial dimension. The ground state of this model has a non-trivial sign structure, especially for J2/J1>0.5, forcing us to work with complex-valued RBMs. Two variational Ans\"atze are discussed: one defined through a fully complex RBM, and one in which two different real-valued networks are used to approximate modulus and phase of the wave function. In both cases, translational invariance is imposed by considering linear combinations of RBMs, giving access also to the lowest-energy excitations at fixed momentum k. We perform a systematic study on small clusters to evaluate the accuracy of these wave functions in comparison to exact results, providing evidence for the supremacy of the fully complex RBM. Our calculations show that this kind of Ans\"atze is very flexible and describes both gapless and gapped ground states, also capturing the incommensurate spin-spin correlations and low-energy spectrum for J2/J1>0.5. The RBM results are also compared to the ones obtained with Gutzwiller-projected fermionic states, often employed to describe quantum spin models [F. Ferrari, A. Parola, S. Sorella and F. Becca, Phys. Rev. B 97, 235103 (2018)]. Contrary to the latter class of variational states, the fully-connected structure of RBMs hampers the transferability of the wave function from small to large clusters, implying an increase of the computational cost with the system size.
Accuracy of restricted Boltzmann machines for the one-dimensional J1−J2 Heisenberg model
Neural networks have been recently proposed as variational wave functions for quantum many-body systems [G. Carleo and M. Troyer, Science 355, 602 (2017)]. In this work, we focus on a specific architecture, known as restricted Boltzmann machine (RBM), and analyse its accuracy for the spin-1/2 J_1-J_2 J 1 − J 2 antiferromagnetic Heisenberg model in one spatial dimension. The ground state of this model has a non-trivial sign structure, especially for J_2/J_1>0.5 J 2 / J 1 > 0.5 , forcing us to work with complex-valued RBMs. Two variational Ansätze are discussed: one defined through a fully complex RBM, and one in which two different real-valued networks are used to approximate modulus and phase of the wave function. In both cases, translational invariance is imposed by considering linear combinations of RBMs, giving access also to the lowest-energy excitations at fixed momentum k. We perform a systematic study on small clusters to evaluate the accuracy of these wave functions in comparison to exact results, providing evidence for the supremacy of the fully complex RBM. Our calculations show that this kind of Ansätze is very flexible and describes both gapless and gapped ground states, also capturing the incommensurate spin-spin correlations and low-energy spectrum for J_2/J_1>0.5 J 2 / J 1 > 0.5 . The RBM results are also compared to the ones obtained with Gutzwiller-projected fermionic states, often employed to describe quantum spin models [F. Ferrari, A. Parola, S. Sorella and F. Becca, Phys. Rev. B 97, 235103 (2018)]. Contrary to the latter class of variational states, the fully-connected structure of RBMs hampers the transferability of the wave function from small to large clusters, implying an increase in the computational cost with the system size.
Neural quantum states efficiently represent many-body wavefunctions with neural networks, but the cost of Monte Carlo sampling limits their scaling to large system sizes. Here we address this challenge by combining sparse Boltzmann machine architectures with probabilistic computing hardware. We implement a probabilistic computer on field-programmable gate arrays (FPGAs) and use it as a fast sampler for energy-based neural quantum states. For the two-dimensional transverse-field Ising model at criticality, we obtain accurate ground-state energies for lattices up to 80$\times$80 (6400 spins) using a custom multi-FPGA cluster. Furthermore, we introduce a dual-sampling algorithm to train deep Boltzmann machines, replacing intractable marginalization with conditional sampling over auxiliary layers. This enables the training of sparse deep models and improves parameter efficiency relative to shallow networks. We further implement this algorithm on a single FPGA, demonstrating the training of deep Boltzmann machines for systems as large as 30×30 (900 spins). Together, these results demonstrate that probabilistic hardware can overcome the sampling bottleneck in variational simulation of quantum many-body systems, opening a path to larger system sizes and deeper variational architectures.