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:2003.01358 · Physical Review A

Calculating Rényi entropies with neural autoregressive quantum states

Zhaoyou Wang, Emily J. Davis

Published Dec 16, 2020• 18 citations
arXivHTMLPDF

Abstract

Entanglement entropy is an essential metric for characterizing quantum many-body systems, but its numerical evaluation for neural network representations of quantum states has so far been inefficient and demonstrated only for the restricted Boltzmann machine architecture. Here we estimate generalized R\'enyi entropies of autoregressive neural quantum states with up to $N=256$ spins using quantum Monte Carlo methods. A naive ``direct sampling'' approach performs well for low-order R\'enyi entropies but fails for larger orders when benchmarked on a one-dimensional Heisenberg model. We therefore propose an improved ``conditional sampling'' method exploiting the autoregressive structure of the network ansatz, which outperforms direct sampling and facilitates calculations of higher-order R\'enyi entropies in both one- and two-dimensional Heisenberg models. Access to higher-order R\'enyi entropies allows for an approximation of the von Neumann entropy as well as extraction of the single-copy entanglement. Both methods elucidate the potential of neural network quantum states in quantum Monte Carlo studies of entanglement entropy for many-body systems.

DOI
10.1103/physreva.102.062413

Related papers

Rényi entanglement entropy of a spin chain with generative neural networks

P. Białas, Piotr Korcyl, Tomasz Stebel +1 more

We describe a method to estimate Rényi entanglement entropy of a spin system which is based on the replica trick and generative neural networks with explicit probability estimation. It can be extended to any spin system or lattice field theory. We demonstrate our method on a one-dimensional quantum Ising spin chain. As the generative model, we use a hierarchy of autoregressive networks, allowing us to simulate up to 32 spins. We calculate the second Rényi entropy and its derivative and cross-check our results with the numerical evaluation of entropy and results available in the literature.

arXiv:2406.06193•Physical review. E•Oct 15, 2024•5 citations

Deep Autoregressive Models for the Efficient Variational Simulation of Many-Body Quantum Systems

Or Sharir, Yoav Levine, Noam Wies +2 more

Artificial neural networks were recently shown to be an efficient representation of highly entangled many-body quantum states. In practical applications, neural-network states inherit numerical schemes used in variational Monte Carlo method, most notably the use of Markov-chain Monte Carlo (MCMC) sampling to estimate quantum expectations. The local stochastic sampling in MCMC caps the potential advantages of neural networks in two ways: (i) Its intrinsic computational cost sets stringent practical limits on the width and depth of the networks, and therefore limits their expressive capacity; (ii) its difficulty in generating precise and uncorrelated samples can result in estimations of observables that are very far from their true value. Inspired by the state-of-the-art generative models used in machine learning, we propose a specialized neural-network architecture that supports efficient and exact sampling, completely circumventing the need for Markov-chain sampling. We demonstrate our approach for two-dimensional interacting spin models, showcasing the ability to obtain accurate results on larger system sizes than those currently accessible to neural-network quantum states.

arXiv:1902.04057•Physical Review Letters•Jan 16, 2020•257 citations

Estimation of the Reduced Density Matrix and Entanglement Entropies Using Autoregressive Networks

P. Białas, Piotr Korcyl, Tomasz Stebel +1 more

Matrix elements of the density matrix of small quantum systems have recently become experimentally accessible within the cold atoms simulations. Numerical estimation of these quantities is known to be computationally challenging. Tracing out a part of the studied system and hence accessing the reduced density matrices offers similar difficulties, but it is more interesting, as the reduced density matrix is the basis of entanglement entropy measures. In this work, we present a method of estimating the individual elements of the reduced density matrices that uses autoregressive neural networks and the path integral quantization approach. We use a hierarchy of neural networks capable of estimating conditional probabilities of consecutive spins to evaluate elements of reduced density matrices directly. Using the Ising chain as an example, we calculate the continuum limit of the ground state’s von Neumann and Rényi bipartite entanglement entropies of an interval built of up to 5 spins. We demonstrate that our architecture is able to estimate all the needed matrix elements with just a single training for a fixed temperature discretization and lattice volume. Our method can be applied to other types of spin chains, possibly with defects, as well as to estimating entanglement entropies of thermal states at non-zero temperature. Hence, it may offer an attractive computational approach as a counterpart to the experimental effort. Abstract Published by the Jagiellonian University 2025 authors

arXiv:2506.04170•Acta Physica Polonica B•Dec 4, 2025•0 citations

Measuring Renyi Entanglement Entropy in Quantum Monte Carlo Simulations

Matthew B. Hastings, Iván González, Ann B. Kallin +1 more

We develop a quantum Monte Carlo procedure, in the valence bond basis, to measure the Renyi entanglement entropy of a many-body ground state as the expectation value of a unitary Swap operator acting on two copies of the system. An improved estimator involving the ratio of Swap operators for different subregions enables convergence of the entropy in a simulation time polynomial in the system size. We demonstrate convergence of the Renyi entropy to exact results for a Heisenberg chain. Finally, we calculate the scaling of the Renyi entropy in the two-dimensional Heisenberg model and confirm that the Néel ground state obeys the expected area law for systems up to linear size L=32.

arXiv:1001.2335•Physical Review Letters•Apr 14, 2010•427 citations

Wang-Landau method for calculating Rényi entropies in finite-temperature quantum Monte Carlo simulations

Stephen Inglis, Roger G. Melko

We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) simulations for the purpose of calculating the Rényi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analog to the density of states for stochastic series expansion QMC, allowing a direct calculation of Rényi entropies without explicit thermodynamic integration. We benchmark results for the mutual information on two-dimensional (2D) isotropic and anisotropic Heisenberg models, a 2D transverse field Ising model, and a three-dimensional Heisenberg model, confirming a critical scaling of the mutual information in cases with a finite-temperature transition. We discuss the benefits and limitations of broad sampling techniques compared to standard importance sampling methods.

arXiv:1207.5052•Physical Review E•Jan 22, 2013•49 citations

The expressivity of classical and quantum neural networks on entanglement entropy

Chih-Hung Wu, Ching-Che Yen

Abstract Analytically continuing the von Neumann entropy from Rényi entropies is a challenging task in quantum field theory. While the n -th Rényi entropy can be computed using the replica method in the path integral representation of quantum field theory, the analytic continuation can only be achieved for some simple systems on a case-by-case basis. In this work, we propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. We begin by studying several examples with known von Neumann entropy, where the input data is generated by representing $${\text {Tr}}\rho _A^n$$ Tr ρ A n with a generating function. We adopt KerasTuner to determine the optimal network architecture and hyperparameters with limited data. In addition, we frame a similar problem in terms of quantum machine learning models, where the expressivity of the quantum models for the entanglement entropy as a partial Fourier series is established. Our proposed methods can accurately predict the von Neumann and Rényi entropies numerically, highlighting the potential of deep learning techniques for solving problems in quantum information theory.

arXiv:2305.00997•The European Physical Journal C•Feb 26, 2024•4 citations
Entanglement entropy is an essential metric for characterizing quantum many-body systems, but its numerical evaluation for neural network representations of quantum states has so far been inefficient and demonstrated only for the restricted Boltzmann machine architecture. Here we estimate generalized R'enyi entropies of autoregressive neural quantum states with up to N=256N=256N=256 spins using quantum Monte Carlo methods. A naive direct sampling'' approach performs well for low-order R\'enyi entropies but fails for larger orders when benchmarked on a one-dimensional Heisenberg model. We therefore propose an improved conditional sampling'' method exploiting the autoregressive structure of the network ansatz, which outperforms direct sampling and facilitates calculations of higher-order R'enyi entropies in both one- and two-dimensional Heisenberg models. Access to higher-order R'enyi entropies allows for an approximation of the von Neumann entropy as well as extraction of the single-copy entanglement. Both methods elucidate the potential of neural network quantum states in quantum Monte Carlo studies of entanglement entropy for many-body systems.
We describe a method to estimate Rényi entanglement entropy of a spin system which is based on the replica trick and generative neural networks with explicit probability estimation. It can be extended to any spin system or lattice field theory. We demonstrate our method on a one-dimensional quantum Ising spin chain. As the generative model, we use a hierarchy of autoregressive networks, allowing us to simulate up to 32 spins. We calculate the second Rényi entropy and its derivative and cross-check our results with the numerical evaluation of entropy and results available in the literature.
Artificial neural networks were recently shown to be an efficient representation of highly entangled many-body quantum states. In practical applications, neural-network states inherit numerical schemes used in variational Monte Carlo method, most notably the use of Markov-chain Monte Carlo (MCMC) sampling to estimate quantum expectations. The local stochastic sampling in MCMC caps the potential advantages of neural networks in two ways: (i) Its intrinsic computational cost sets stringent practical limits on the width and depth of the networks, and therefore limits their expressive capacity; (ii) its difficulty in generating precise and uncorrelated samples can result in estimations of observables that are very far from their true value. Inspired by the state-of-the-art generative models used in machine learning, we propose a specialized neural-network architecture that supports efficient and exact sampling, completely circumventing the need for Markov-chain sampling. We demonstrate our approach for two-dimensional interacting spin models, showcasing the ability to obtain accurate results on larger system sizes than those currently accessible to neural-network quantum states.
Matrix elements of the density matrix of small quantum systems have recently become experimentally accessible within the cold atoms simulations. Numerical estimation of these quantities is known to be computationally challenging. Tracing out a part of the studied system and hence accessing the reduced density matrices offers similar difficulties, but it is more interesting, as the reduced density matrix is the basis of entanglement entropy measures. In this work, we present a method of estimating the individual elements of the reduced density matrices that uses autoregressive neural networks and the path integral quantization approach. We use a hierarchy of neural networks capable of estimating conditional probabilities of consecutive spins to evaluate elements of reduced density matrices directly. Using the Ising chain as an example, we calculate the continuum limit of the ground state’s von Neumann and Rényi bipartite entanglement entropies of an interval built of up to 5 spins. We demonstrate that our architecture is able to estimate all the needed matrix elements with just a single training for a fixed temperature discretization and lattice volume. Our method can be applied to other types of spin chains, possibly with defects, as well as to estimating entanglement entropies of thermal states at non-zero temperature. Hence, it may offer an attractive computational approach as a counterpart to the experimental effort. Abstract Published by the Jagiellonian University 2025 authors
We develop a quantum Monte Carlo procedure, in the valence bond basis, to measure the Renyi entanglement entropy of a many-body ground state as the expectation value of a unitary Swap operator acting on two copies of the system. An improved estimator involving the ratio of Swap operators for different subregions enables convergence of the entropy in a simulation time polynomial in the system size. We demonstrate convergence of the Renyi entropy to exact results for a Heisenberg chain. Finally, we calculate the scaling of the Renyi entropy in the two-dimensional Heisenberg model and confirm that the Néel ground state obeys the expected area law for systems up to linear size L=32.
We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) simulations for the purpose of calculating the Rényi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analog to the density of states for stochastic series expansion QMC, allowing a direct calculation of Rényi entropies without explicit thermodynamic integration. We benchmark results for the mutual information on two-dimensional (2D) isotropic and anisotropic Heisenberg models, a 2D transverse field Ising model, and a three-dimensional Heisenberg model, confirming a critical scaling of the mutual information in cases with a finite-temperature transition. We discuss the benefits and limitations of broad sampling techniques compared to standard importance sampling methods.
Abstract Analytically continuing the von Neumann entropy from Rényi entropies is a challenging task in quantum field theory. While the n -th Rényi entropy can be computed using the replica method in the path integral representation of quantum field theory, the analytic continuation can only be achieved for some simple systems on a case-by-case basis. In this work, we propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. We begin by studying several examples with known von Neumann entropy, where the input data is generated by representing TrρAn{\text {Tr}}\rho _A^nTrρAn​ Tr ρ A n with a generating function. We adopt KerasTuner to determine the optimal network architecture and hyperparameters with limited data. In addition, we frame a similar problem in terms of quantum machine learning models, where the expressivity of the quantum models for the entanglement entropy as a partial Fourier series is established. Our proposed methods can accurately predict the von Neumann and Rényi entropies numerically, highlighting the potential of deep learning techniques for solving problems in quantum information theory.