Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.36113

Collectivity limits quantum entanglement

Donghoon Kim, Tomotaka Kuwahara

quant-phcond-mat.dis-nncond-mat.stat-mechmath-phSubmitted Sep 28, 2026• Announced Sep 30, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Sep 28, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

Understanding what limits many-body quantum entanglement is a central problem in physics. Spatial locality has long provided a fundamental mechanism: correlations between a region and its complement must be mediated through a small spatial interface, thereby constraining their entanglement. Here we show that universal constraints on entanglement can persist even when interactions are strongly nonlocal, through collectivity: many weak interactions generate fluctuations controlled by their square-summed, rather than total, strength. We establish this mechanism rigorously for generic gapped Hamiltonians with Kac-normalized power-law interactions $r^{-α}$ on a $D$-dimensional lattice. For arbitrary bipartitions, we prove that the ground-state entanglement scales at most logarithmically with system size for $α<D/2$ and subextensively for $D/2<α<D$, due to suppressed collective fluctuations around individual sites. For spatially regular bipartitions with codimension-one boundaries, we use a renormalization-group construction to extend this suppression to larger length scales, yielding polylogarithmic scaling for $D/2 < α< (D+1) / 2$ and parametrically stronger subvolume bounds for $(D+1)/2<α<D$. We also establish the corresponding optimality results: for arbitrary bipartitions, the logarithmic scaling for $α<D/2$ is optimal and $α=D/2$ marks the optimal threshold for universal logarithmic bounds, while for regular bipartitions the threshold at $α=(D+1)/2$ is likewise optimal for universal polylogarithmic bounds when $D\ge2$. Together, these results reveal collectivity as a fundamental mechanism for constraining many-body entanglement alongside spatial locality.

AI Summary

The paper asks whether gapped ground-state entanglement can be constrained without spatial locality. It considers two-body Hamiltonians on a $D$-dimensional lattice with $n$ fixed-dimensional sites, bounded on-site terms, and interactions satisfying $\|h_{ij}\|\le J\mu_{ij}n^{-(1-\alpha/D)}r_{ij}^{-\alpha}$ for $0\le\alpha<D$, where $\mu_{ij}$ permits a fixed nearest-neighborhood enhancement. A unique ground state and system-size-independent spectral gap are assumed; no translation or permutation symmetry is required. For arbitrary bipartitions, the entropy bounds are $O(\log n)$ for $\alpha<D/2$, $O((\log n)^2)$ at $\alpha=D/2$, and $O(n^{(2\alpha-D)/D}\log n)$ above it. The below- and above-threshold scalings are matched by constructions. For regular codimension-one cuts, the bounds improve to polylogarithmic scaling for $D/2<\alpha<(D+1)/2$, $O_\varepsilon(n^\varepsilon)$ at $\alpha=(D+1)/2<D$, and $O_\varepsilon(n^{(2\alpha-D-1)/(D-1)+\varepsilon})$ above it. For $D\ge2$, uniformly gapped examples exhibit polynomial entropy arbitrarily close above the second threshold, ruling out extending universal polylogarithmic bounds into any right neighborhood. The proof combines a gap–variance inequality controlled by square-summed coupling strengths with local reflections, bounding the subleading one-site Schmidt weight. Subadditivity yields the arbitrary-cut bounds. Regular-cut bounds use iterative low-deviation block truncations, gap preservation, dimension-independent square-sum interaction estimates, and multiscale entropy reconstruction. The regular-cut exponent above the second threshold is not established as optimal, and scaling at that threshold remains unresolved. The results require Kac normalization, two-body interactions, and a unique uniformly gapped ground state; extensions to other interaction profiles or nonground states remain open.

Little sign of AI-generated textMissing comparisonStrong assumptions

Error found: The abstract omits the essential unique-ground-state assumption: gapped Hamiltonians with extensive free ground-space degrees of freedom satisfy the interaction bounds yet admit volume-law-entangled ground states, so the advertised universal bounds require the qualifications stated in the body.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, 3 figures; 95 pages Supplementary Material

Related papers

Quantum complexity and generalized area law in fully connected models

Donghoon Kim, Tomotaka Kuwahara

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.

arXiv:2411.02140•Nov 4, 2024•5 citations

Entanglement scaling in lattice systems

K M R Audenaert, M. Cramer, Jens Eisert +1 more

We review some recent rigorous results on scaling laws of entanglement properties in quantum many body systems. More specifically, we study the entanglement of a region with its surrounding and determine its scaling behaviour with its size for systems in the ground and thermal states of bosonic and fermionic lattice systems. A theorem connecting entanglement between a region and the rest of the lattice with the surface area of the boundary between the two regions is presented for non-critical systems in arbitrary spatial dimensions. The entanglement scaling in the field limit exhibits a peculiar difference between fermionic and bosonic systems. In one-spatial dimension a logarithmic divergence is recovered for both bosonic and fermionic systems. In two spatial dimensions in the setting of half-spaces however we observe strict area scaling for bosonic systems and a multiplicative logarithmic correction to such an area scaling in fermionic systems. Similar questions may be posed and answered in classical systems.

Journal of Physics Conference Series•May 1, 2007•0 citations

Universal Slow Growth of Entanglement in Interacting Strongly Disordered Systems

Maksym Serbyn, Zlatko Papić, Dmitry A. Abanin

Recent numerical work by Bardarson, Pollmann, and Moore revealed a slow, logarithmic in time, growth of the entanglement entropy for initial product states in a putative many-body localized phase. We show that this surprising phenomenon results from the dephasing due to exponentially small interaction-induced corrections to the eigenenergies of different states. For weak interactions, we find that the entanglement entropy grows as ξln(Vt/ℏ), where V is the interaction strength, and ξ is the single-particle localization length. The saturated value of the entanglement entropy at long times is determined by the participation ratios of the initial state over the eigenstates of the subsystem. Our work shows that the logarithmic entanglement growth is a universal phenomenon characteristic of the many-body localized phase in any number of spatial dimensions, and reveals a broad hierarchy of dephasing time scales present in such a phase.

arXiv:1304.4605•Physical Review Letters•Jun 28, 2013•625 citations

Entanglement Rates and Area Laws

Karel Van Acoleyen, Michael Mariën, Frank Verstraete

We prove an upper bound on the maximal rate at which a Hamiltonian interaction can generate entanglement in a bipartite system. The scaling of this bound as a function of the subsystem dimension on which the Hamiltonian acts nontrivially is optimal and is exponentially improved over previously known bounds. As an application, we show that a gapped quantum many-body spin system on an arbitrary lattice satisfies an area law for the entanglement entropy if and only if any other state with which it is adiabatically connected (i.e., any state in the same phase) also satisfies an area law.

arXiv:1304.5931•Physical Review Letters•Oct 23, 2013•104 citations

Entanglement-Induced Resilience of Quantum Dynamics

Tianfeng Feng, Yue Cao, Wenjun Yu +4 more

Quantum many-body devices suffer from imperfections that destabilize dynamics and limit scalability. We show that the dynamical growth of entanglement can intrinsically protect generic quantum dynamics against coherent and perturbative noise. Through rigorous theoretical analysis of general quantum dynamics and numerical simulations of spin chains and fermionic lattices, we prove that entanglement-entropy growth confines the influence of local Hamiltonian perturbations, thereby suppressing errors in dynamical errors. The degree of protection correlates quantitatively with the entanglement entropy of subsystems on which the perturbations act, and applies broadly to both analog quantum simulators and real-time control protocols. This entanglement-induced resilience is conceptually distinct from quantum error correction or dynamical decoupling: it passively leverages native many-body correlations without additional qubits, measurements, or control overhead. Our results reveal a generic mechanism linking entanglement growth to dynamical stability and provide practical guidelines for designing noise-resilient quantum devices.

quant-pharXiv:2602.20987•Science Advances•Feb 25, 2026•0 citations

Toward Optimal Circuit Depth for Geometrically Local Hamiltonian Simulation

Zheyu Shen, Yusen Wu, Penghui Yao +2 more

Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy $ε$, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an $n$-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time $T\ge1$, with circuit depth $O(T\log(nT/ε))$ and gate count $O(nT\log(nT/ε))$. This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time $T$ in the stated regime and sufficiently small fixed error $ε$, any nearest-neighbor quantum circuit simulating these dynamics requires depth $Ω(\log n/\log\log n)$. This matches our $O(\log n)$ upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.

quant-pharXiv:2610.01839•Oct 2, 2026•0 citations
Understanding what limits many-body quantum entanglement is a central problem in physics. Spatial locality has long provided a fundamental mechanism: correlations between a region and its complement must be mediated through a small spatial interface, thereby constraining their entanglement. Here we show that universal constraints on entanglement can persist even when interactions are strongly nonlocal, through collectivity: many weak interactions generate fluctuations controlled by their square-summed, rather than total, strength. We establish this mechanism rigorously for generic gapped Hamiltonians with Kac-normalized power-law interactions r−αr^{-α}r−α on a DDD-dimensional lattice. For arbitrary bipartitions, we prove that the ground-state entanglement scales at most logarithmically with system size for α<D/2α<D/2α<D/2 and subextensively for D/2<α<DD/2<α<DD/2<α<D, due to suppressed collective fluctuations around individual sites. For spatially regular bipartitions with codimension-one boundaries, we use a renormalization-group construction to extend this suppression to larger length scales, yielding polylogarithmic scaling for D/2<α<(D+1)/2D/2 < α< (D+1) / 2D/2<α<(D+1)/2 and parametrically stronger subvolume bounds for (D+1)/2<α<D(D+1)/2<α<D(D+1)/2<α<D. We also establish the corresponding optimality results: for arbitrary bipartitions, the logarithmic scaling for α<D/2α<D/2α<D/2 is optimal and α=D/2α=D/2α=D/2 marks the optimal threshold for universal logarithmic bounds, while for regular bipartitions the threshold at α=(D+1)/2α=(D+1)/2α=(D+1)/2 is likewise optimal for universal polylogarithmic bounds when D≥2D\ge2D≥2. Together, these results reveal collectivity as a fundamental mechanism for constraining many-body entanglement alongside spatial locality.
The paper asks whether gapped ground-state entanglement can be constrained without spatial locality. It considers two-body Hamiltonians on a DDD-dimensional lattice with nnn fixed-dimensional sites, bounded on-site terms, and interactions satisfying ∥hij∥≤Jμijn−(1−α/D)rij−α\|h_{ij}\|\le J\mu_{ij}n^{-(1-\alpha/D)}r_{ij}^{-\alpha}∥hij​∥≤Jμij​n−(1−α/D)rij−α​ for 0≤α<D0\le\alpha<D0≤α<D, where μij\mu_{ij}μij​ permits a fixed nearest-neighborhood enhancement. A unique ground state and system-size-independent spectral gap are assumed; no translation or permutation symmetry is required.
For arbitrary bipartitions, the entropy bounds are O(log⁡n)O(\log n)O(logn) for α<D/2\alpha<D/2α<D/2, O((log⁡n)2)O((\log n)^2)O((logn)2) at α=D/2\alpha=D/2α=D/2, and O(n(2α−D)/Dlog⁡n)O(n^{(2\alpha-D)/D}\log n)O(n(2α−D)/Dlogn) above it. The below- and above-threshold scalings are matched by constructions. For regular codimension-one cuts, the bounds improve to polylogarithmic scaling for D/2<α<(D+1)/2D/2<\alpha<(D+1)/2D/2<α<(D+1)/2, Oε(nε)O_\varepsilon(n^\varepsilon)Oε​(nε) at α=(D+1)/2<D\alpha=(D+1)/2<Dα=(D+1)/2<D, and Oε(n(2α−D−1)/(D−1)+ε)O_\varepsilon(n^{(2\alpha-D-1)/(D-1)+\varepsilon})Oε​(n(2α−D−1)/(D−1)+ε) above it. For D≥2D\ge2D≥2, uniformly gapped examples exhibit polynomial entropy arbitrarily close above the second threshold, ruling out extending universal polylogarithmic bounds into any right neighborhood.
The proof combines a gap–variance inequality controlled by square-summed coupling strengths with local reflections, bounding the subleading one-site Schmidt weight. Subadditivity yields the arbitrary-cut bounds. Regular-cut bounds use iterative low-deviation block truncations, gap preservation, dimension-independent square-sum interaction estimates, and multiscale entropy reconstruction.
The regular-cut exponent above the second threshold is not established as optimal, and scaling at that threshold remains unresolved. The results require Kac normalization, two-body interactions, and a unique uniformly gapped ground state; extensions to other interaction profiles or nonground states remain open.
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.
We review some recent rigorous results on scaling laws of entanglement properties in quantum many body systems. More specifically, we study the entanglement of a region with its surrounding and determine its scaling behaviour with its size for systems in the ground and thermal states of bosonic and fermionic lattice systems. A theorem connecting entanglement between a region and the rest of the lattice with the surface area of the boundary between the two regions is presented for non-critical systems in arbitrary spatial dimensions. The entanglement scaling in the field limit exhibits a peculiar difference between fermionic and bosonic systems. In one-spatial dimension a logarithmic divergence is recovered for both bosonic and fermionic systems. In two spatial dimensions in the setting of half-spaces however we observe strict area scaling for bosonic systems and a multiplicative logarithmic correction to such an area scaling in fermionic systems. Similar questions may be posed and answered in classical systems.
Recent numerical work by Bardarson, Pollmann, and Moore revealed a slow, logarithmic in time, growth of the entanglement entropy for initial product states in a putative many-body localized phase. We show that this surprising phenomenon results from the dephasing due to exponentially small interaction-induced corrections to the eigenenergies of different states. For weak interactions, we find that the entanglement entropy grows as ξln(Vt/ℏ), where V is the interaction strength, and ξ is the single-particle localization length. The saturated value of the entanglement entropy at long times is determined by the participation ratios of the initial state over the eigenstates of the subsystem. Our work shows that the logarithmic entanglement growth is a universal phenomenon characteristic of the many-body localized phase in any number of spatial dimensions, and reveals a broad hierarchy of dephasing time scales present in such a phase.
We prove an upper bound on the maximal rate at which a Hamiltonian interaction can generate entanglement in a bipartite system. The scaling of this bound as a function of the subsystem dimension on which the Hamiltonian acts nontrivially is optimal and is exponentially improved over previously known bounds. As an application, we show that a gapped quantum many-body spin system on an arbitrary lattice satisfies an area law for the entanglement entropy if and only if any other state with which it is adiabatically connected (i.e., any state in the same phase) also satisfies an area law.
Quantum many-body devices suffer from imperfections that destabilize dynamics and limit scalability. We show that the dynamical growth of entanglement can intrinsically protect generic quantum dynamics against coherent and perturbative noise. Through rigorous theoretical analysis of general quantum dynamics and numerical simulations of spin chains and fermionic lattices, we prove that entanglement-entropy growth confines the influence of local Hamiltonian perturbations, thereby suppressing errors in dynamical errors. The degree of protection correlates quantitatively with the entanglement entropy of subsystems on which the perturbations act, and applies broadly to both analog quantum simulators and real-time control protocols. This entanglement-induced resilience is conceptually distinct from quantum error correction or dynamical decoupling: it passively leverages native many-body correlations without additional qubits, measurements, or control overhead. Our results reveal a generic mechanism linking entanglement growth to dynamical stability and provide practical guidelines for designing noise-resilient quantum devices.
Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy εεε, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an nnn-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time T≥1T\ge1T≥1, with circuit depth O(Tlog⁡(nT/ε))O(T\log(nT/ε))O(Tlog(nT/ε)) and gate count O(nTlog⁡(nT/ε))O(nT\log(nT/ε))O(nTlog(nT/ε)). This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time TTT in the stated regime and sufficiently small fixed error εεε, any nearest-neighbor quantum circuit simulating these dynamics requires depth Ω(log⁡n/log⁡log⁡n)Ω(\log n/\log\log n)Ω(logn/loglogn). This matches our O(log⁡n)O(\log n)O(logn) upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.