REVIEW 3 cited by
Tripartite information at long distances
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
Tripartite information at long distances
read the original abstract
We compute the leading term of the tripartite information at long distances for three spheres in a CFT. This falls as $r^{-6\Delta}$, where $r$ is the typical distance between the spheres, and $\Delta$, the lowest primary field dimension. The coefficient turns out to be a combination of terms coming from the two- and three-point functions and depends on the OPE coefficient of the field. We check the result with three-dimensional free scalars in the lattice finding excellent agreement. When the lowest-dimensional field is a scalar, we find that the mutual information can be monogamous only for quite large OPE coefficients, far away from a perturbative regime. When the lowest-dimensional primary is a fermion, we argue that the scaling must always be faster than $r^{-6\Delta_f}$. In particular, lattice calculations suggest a leading scaling $ r^{-(6\Delta_f+1)}$. For free fermions in three dimensions, we show that mutual information is also non-monogamous in the long-distance regime.
Forward citations
Cited by 3 Pith papers
-
Mutual Information from Modular Flow in General CFTs
A hierarchy of approximations to the mutual information in CFTs is derived from modular flow and two-point functions of primaries, providing a high-precision formula for arbitrary ball separations that supersedes prev...
-
Complexity Inequalities for Quantum Subsystems
Introduces tripartite complexity and complexity gap for three-region subsystems and reports that the gap has a definite sign in holographic volume complexity, Fisher-Rao Gaussian complexity, and Krylov-space approaches.
-
Complexity Inequalities for Quantum Subsystems
Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for comp...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.