REVIEW 2 cited by
Entanglement Entropy of Eigenstates of Quadratic Fermionic Hamiltonians
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In a seminal paper [D. N. Page, Phys. Rev. Lett. 71, 1291 (1993)], Page proved that the average entanglement entropy of subsystems of random pure states is $S_{\rm ave}\simeq\ln{\cal D}_{\rm A} - (1/2) {\cal D}_{\rm A}^2/{\cal D}$ for $1\ll{\cal D}_{\rm A}\leq\sqrt{\cal D}$, where ${\cal D}_{\rm A}$ and ${\cal D}$ are the Hilbert space dimensions of the subsystem and the system, respectively. Hence, typical pure states are (nearly) maximally entangled. We develop tools to compute the average entanglement entropy $\langle S\rangle$ of all eigenstates of quadratic fermionic Hamiltonians. In particular, we derive exact bounds for the most general translationally invariant models $\ln{\cal D}_{\rm A} - (\ln{\cal D}_{\rm A})^2/\ln{\cal D} \leq \langle S \rangle \leq \ln{\cal D}_{\rm A} - [1/(2\ln2)] (\ln{\cal D}_{\rm A})^2/\ln{\cal D}$. Consequently we prove that: (i) if the subsystem size is a finite fraction of the system size then $\langle S\rangle<\ln{\cal D}_{\rm A}$ in the thermodynamic limit, i.e., the average over eigenstates of the Hamiltonian departs from the result for typical pure states, and (ii) in the limit in which the subsystem size is a vanishing fraction of the system size, the average entanglement entropy is maximal, i.e., typical eigenstates of such Hamiltonians exhibit eigenstate thermalization.
Forward citations
Cited by 2 Pith papers
-
Extreme value statistics and eigenstate thermalization in kicked quantum chaotic spin-$1/2$ chains
The largest entanglement eigenvalue of a quantum chaotic kicked Ising chain follows a Weibull-type extreme value distribution rather than the random-matrix Tracy-Widom law, even as ETH is satisfied.
-
Efficient computation of average subsystem Bures distance between fermionic Gaussian states
An efficient Bures-distance algorithm for fermionic Gaussian states shows linear average subsystem-distance growth in the integrable Ising chain, but not in quadratic SYK or random Gaussian states.
Discussion (0). Sign in to comment.