pith. sign in

arxiv: 2506.04170 · v1 · pith:S4CLDA3Inew · submitted 2025-06-04 · 🪐 quant-ph · cond-mat.stat-mech· cs.LG· hep-lat· hep-th

Estimation of the reduced density matrix and entanglement entropies using autoregressive networks

classification 🪐 quant-ph cond-mat.stat-mechcs.LGhep-lathep-th
keywords entanglemententropiesnetworksspinautoregressivechainsdensityelements
0
0 comments X
read the original abstract

We present an application of autoregressive neural networks to Monte Carlo simulations of quantum spin chains using the correspondence with classical two-dimensional spin systems. 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\'enyi 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 time 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Sampling two-dimensional spin systems with transformers

    cond-mat.dis-nn 2026-04 unverdicted novelty 7.0

    Transformer networks sample up to 180x180 2D Ising systems and 64x64 Edwards-Anderson systems by generating spin groups with probability approximations, yielding ~20x higher effective sample size than prior neural sam...

  2. Variational Autoregressive Networks with probability priors

    cs.LG 2026-05 unverdicted novelty 5.0

    Incorporating probability priors into variational autoregressive networks reduces training burden and enables larger system sizes for sampling in the Ising and Edwards-Anderson models.