Temporal entropy and the complexity of computing the expectation value of local operators after a quench
Jul 21, 202310 pages
Published in:
- Phys.Rev.Res. 6 (2024) 3, 033021
- Published: Jul 3, 2024
e-Print:
- 2307.11649 [cond-mat.stat-mech]
DOI:
- 10.1103/PhysRevResearch.6.033021 (publication)
View in:
Citations per year
Abstract: (APS)
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(MPSs) and argue that it is intimately related to that of encoding temporal transition matrices and their partial traces. We show that we can upper-bound the rank of these reduced transition matrices by one of the Heisenberg evolution of local operators, thus making aconnection between two apparently different quantities, the temporal entanglement and the local operator entanglement(OE). As a result, whenever the local OE grows slower than linearly in time, we show that computing time-dependent expectation values of local operators using temporal MPSs is likely advantageous with respect to computing the same quantities using standard MPS techniques.Note:
- 10 pages, 8 figures. v2: extended discussion and improved figures, matches published version
References(0)
Figures(8)
Loading ...