Capturing exponential variance using polynomial resources: applying tensor networks to non-equilibrium stochastic processes

Abstract

Estimating the expected value of an observable appearing in a non-equilibrium stochastic process usually involves sampling. If the observable's variance is high, many samples are required. In contrast, we show that performing the same task without sampling, using tensor network compression, efficiently captures high variances in systems of various geometries and dimensions. We provide examples for which matching the accuracy of our efficient method would require a sample size scaling exponentially with system size. In particular, the high variance observable ${\mathrm{e}}^{-\beta W}$, motivated by Jarzynski's equality, with $W$ the work done quenching from equilibrium at inverse temperature $\beta$, is exactly and efficiently captured by tensor networks.

7 pages, 3 figures, including supplemental material

References in corpus (6)

• The density-matrix renormalization group in the age of matrix product states
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Tensor renormalization group approach to 2D classical lattice models
• The iTEBD algorithm beyond unitary evolution
• Dynamical simulations of classical stochastic systems using matrix product states
• Application of importance sampling to the computation of large deviations in non-equilibrium processes