Rényi exponent landscape of multipartite entanglement in free-fermion systems
- URL: http://arxiv.org/abs/2603.08991v1
- Date: Mon, 09 Mar 2026 22:27:00 GMT
- Title: Rényi exponent landscape of multipartite entanglement in free-fermion systems
- Abstract summary: We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
- Score: 51.56484100374058
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show that the Rényi tripartite information $I_3^{(α)}$ of free fermions exhibits a qualitatively $α$-dependent scaling at small Fermi momentum, in sharp contrast to bipartite entropy where only the prefactor changes. In the rank-1 regime ($z = k_F w \ll 1$), $I_3^{(α)}$ receives contributions from two competing channels -- a fractional-moment channel $\sim z^α$ (active for non-integer $α$) and a polynomial channel $\sim z^m$ from the first nonvanishing inclusion-exclusion moment $σ_m$ -- yielding the scaling exponent $β_m(α) = \min(α, m)$ for $m$-partite information of $m$ adjacent strips. Integer Rényi indices $α= 2, 3, \ldots$ are anomalous: the fractional channel closes and the exponent jumps to $m$ or higher. A direct consequence is a replica obstruction: $I_m^{(n)}/I_m^{(1)} \sim z^{m-1} \to 0$ for all integer $n \geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data at the level of leading scaling -- a situation with no bipartite analog. Conversely, negativity-based measures ($α= 1/2$) give a $20\times$ enhanced signal compared to von Neumann. We derive the underlying product formula for the coefficient $c(w_A, w_B, w_D)$, prove an $m$-partite generating function for the inclusion-exclusion moments, and verify all results numerically to high precision.
Related papers
- Weak Typicality of von Neumann Entanglement Entropy in Gaussian Boson Sampling [2.8224889996383395]
We study the von Neumann entanglement entropy generated by a Haar distributed passive interferometer acting on $n$ equally squeezed input modes with fixed nonzero squeezing strength $s$.<n>For subsystem of $k_n$ modes satisfying $k_n/nto rin(0,1)$, we prove that, for every $varepsilon>0$ and all sufficiently large $n$, $mathbbPleft(left|fracS_1,nmathbbES_1,n$ to $1$, a typical
arXiv Detail & Related papers (2026-08-18T02:04:28Z) - Unitary dynamics and resource trade-offs in a four-qubit isotropic Heisenberg XXX chain with tunable next-nearest-neighbor coupling [0.0]
This study derives the unitary dynamics of a four qubit Heisenberg XXX chain with tunable next nearest neighbor coupling $$.<n>We provide closed form expressions for fidelity $F((0),(t))$, coherence $C_l_1((t))$, and two qubit entanglement of formation $E_F(t)$ for subsystems $12$ and $34$.
arXiv Detail & Related papers (2026-05-06T02:47:21Z) - Tripartite information of free fermions: a universal entanglement coefficient from the sine kernel [51.56484100374058]
We study the tripartite information I_3 of free fermions on two-dimensional lattices partitioned into three adjacent strips of width w.<n>We find that g(z) has a unique zero at z* = 1.329 +/- 0.001: modes with k_F w z* violate monogamy of mutual information.<n>Two exact cancellations -- of the z ln z area-law terms and of the z2 terms -- are intrinsic to the I_3 combination.
arXiv Detail & Related papers (2026-03-03T15:39:35Z) - Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination [65.37519531362157]
We show that any efficient Statistical Query algorithm for this task requires VSTAT complexity at least $tildeOmega(d1/2/alpha2)$.
arXiv Detail & Related papers (2025-10-12T15:42:44Z) - Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
arXiv Detail & Related papers (2025-09-15T14:26:11Z) - The SUSY partners of the QES sextic potential revisited [0.0]
We study the SUSY partner Hamiltonians of the quasi- solvable (QES) sextic potential $Vrm qes(x) = nu, x6 + 2, nu, mu,x4 + left[mu2-(4N+3)nu right], x2$, $N in mathbbZ+$.
arXiv Detail & Related papers (2023-11-10T18:38:02Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - Average R\'{e}nyi Entropy of a Subsystem in Random Pure State [0.0]
We plot the $ln m$-dependence of the quantum information derived from $widetildeS_alpha (m,n)$.
It is remarkable to note that the nearly vanishing region of the information becomes shorten with increasing $alpha$, and eventually disappears in the limit of $alpha rightarrow infty$.
arXiv Detail & Related papers (2023-01-22T08:08:51Z) - Universality in the tripartite information after global quenches [0.0]
We study the R'enyi-$alpha$ tripartite information $I_3(alpha)(A,B,C)$ in clean 1D systems with local Hamiltonians.
We identify different classes of states that, under time evolution with translationally in Hamiltonians, locally relax to states with a nonzero (R'enyi) tripartite information.
arXiv Detail & Related papers (2022-09-28T17:18:00Z) - The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n.
We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
arXiv Detail & Related papers (2022-09-04T10:01:39Z) - Learning a Single Neuron with Adversarial Label Noise via Gradient
Descent [50.659479930171585]
We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations.
The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
arXiv Detail & Related papers (2022-06-17T17:55:43Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.