Papers
Topics
Authors
Recent
Search
2000 character limit reached

Area laws and tensor networks for maximally mixed ground states

Published 29 Oct 2023 in quant-ph, cond-mat.other, cs.CC, cs.IT, and math.IT | (2310.19028v2)

Abstract: We show an area law in the mutual information for the maximally-mixed state $\Omega$ in the ground space of general Hamiltonians, which is independent of the underlying ground space degeneracy. Our result assumes the existence of a `good' approximation to the ground state projector (a good AGSP), a crucial ingredient in previous area-law proofs. Such approximations have been explicitly derived for 1D gapped local Hamiltonians and 2D frustration-free locally-gapped Hamiltonians. As a corollary, we show that in 1D gapped local Hamiltonians, for any $\varepsilon>0$ and any bi-partition $L\cup Lc$ of the system, \begin{align*} \mathrm I_{\max}\varepsilon (L:Lc)_{\Omega} \le \mathrm O \big( \log (|L|\log(d))+\log(1/\varepsilon)\big), \end{align*} where $|L|$ represents the number of sites in $L$, $d$ is the dimension of a site and $ \mathrm I_{\max}\varepsilon (L:Lc)_{\Omega} $ represents the $\varepsilon$-\emph{smoothed maximum mutual information} with respect to the $L:Lc$ partition in $\Omega$. From this bound we then conclude $\mathrm I (L:Lc)_\Omega \le \mathrm O\big(\log(|L|\log(d))\big)$ -- an area law for the mutual information in 1D systems with a logarithmic correction. In addition, we show that $\Omega$ can be approximated in trace norm up to $\varepsilon$ with a state of Schmidt rank of at most $\mathrm{poly}(|L|/\varepsilon)$, leading to a good MPO approximation for $\Omega$ with polynomial bond dimension. Similar corollaries are derived for the mutual information of 2D frustration-free and locally-gapped local Hamiltonians.

Authors (3)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.