On temporal entropy and the complexity of computing the expectation value of local operators after a quench
Stefano Carignano, Carlos Ramos Marimón, Luca Tagliacozzo
TL;DR
This work links the computational cost of simulating time-dependent local observables after a quench to the growth of operator entanglement by bounding the rank of reduced transition matrices with the OE of Heisenberg-evolved operators. By casting the problem in terms of temporal matrix product states on a Keldysh contour and introducing efficient truncation schemes, the authors show that integrable systems—with OE growing only logarithmically—allow polynomial-time simulations, while non-integrable cases tend to require exponential resources. Numerical evidence from Ising models supports the theoretical bound, illustrating when tMPS offers a real advantage over standard MPS methods. The results clarify when temporal approaches are advantageous and propose practical algorithms for compressing the time-evolved local observable dynamics.
Abstract
We study the computational complexity of simulating the time-dependent expectation value of a local operator in a one-dimensional quantum system by using temporal matrix product states. We argue that such cost is intimately related to that of encoding temporal transition matrices and their partial traces. In particular, we show that we can upper-bound the rank of these reduced transition matrices by the one of the Heisenberg evolution of local operators, thus making connection between two apparently different quantities, the temporal entanglement and the local operator entanglement. As a result, whenever the local operator entanglement grows slower than linearly in time, we show that computing time-dependent expectation values of local operators using temporal matrix product states is likely advantageous with respect to computing the same quantities using standard matrix product states techniques.
