Area laws and tensor networks for maximally mixed ground states
October 29, 2023 Β· Declared Dead Β· π Communications in Mathematical Physics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Itai Arad, Raz Firanko, Rahul Jain
arXiv ID
2310.19028
Category
quant-ph: Quantum Computing
Cross-listed
cond-mat.other,
cs.CC,
cs.IT
Citations
1
Venue
Communications in Mathematical Physics
Last Checked
5 months ago
Abstract
We show an area law in the mutual information for the maximally-mixed state $Ξ©$ 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 L^c$ of the system, \begin{align*} \mathrm I_{\max}^\varepsilon (L:L^c)_Ξ© \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:L^c)_Ξ© $ represents the $\varepsilon$-\emph{smoothed maximum mutual information} with respect to the $L:L^c$ partition in $Ξ©$. From this bound we then conclude $\mathrm I (L:L^c)_Ξ© \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 $Ξ©$ 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 $Ξ©$ with polynomial bond dimension. Similar corollaries are derived for the mutual information of 2D frustration-free and locally-gapped local Hamiltonians.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted