Quantum complexity and generalized area law in fully connected models

arXiv:2411.02140 · quant-ph, cond-mat.quant-gas, cond-mat.stat-mech, math-ph, math.MP · Submitted 2024-11-04 · Read on arXiv

quant-ph, cond-mat.quant-gas, cond-mat.stat-mech, math-ph, math.MP

Submitted: 2024-11-04

Updated: 2026-09-24

Comments: 11 pages, 1 figure; 31 pages Supplementary Material

License: http://creativecommons.org/licenses/by/4.0/

The gist: The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description.

Terminology

Abstract

The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.

Sources

Related papers