A new characterization of the holographic entropy cone

• URL: http://arxiv.org/abs/2508.21823v3
• Date: Tue, 04 Nov 2025 22:30:46 GMT
• Title: A new characterization of the holographic entropy cone
• Authors: Guglielmo Grimaldi, Matthew Headrick, Veronika E. Hubeny,
• Abstract summary: Entanglement entropies computed using the holographic Ryu-Takayanagi formula are known to obey an infinite set of linear inequalities.<n>It is unknown whether those same inequalities are also obeyed by entropies computed using the covariant Hubeny-Rangamani-Takayanagi formula.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement entropies computed using the holographic Ryu-Takayanagi formula are known to obey an infinite set of linear inequalities, which define the so-called RT entropy cone. The general structure of this cone, or equivalently the set of all valid inequalities, is unknown. It is also unknown whether those same inequalities are also obeyed by entropies computed using the covariant Hubeny-Rangamani-Takayanagi formula, although significant evidence has accumulated that they are. Using Markov states, we develop a test of this conjecture in a heretofore unexplored regime. The test reduces to checking that a given inequality obeys a certain majorization property, which is easy to evaluate. We find that the RT inequalities pass this test and, surprisingly, only RT inequalities do so. Our results not only provide strong new evidence that the HRT and RT cones coincide, but also offer a completely new characterization of that cone.

Related papers

• Holographic entropy inequalities pass the majorization test [0.7568725564300122]
  We show that quantities computed by minimal cuts are constrained by linear inequalities.<n>This finding adds evidence that the same inequalities also constrain the entropies under time-dependent conditions.
  arXiv  Detail & Related papers  (2026-01-15T02:00:03Z)
• Combinatorial properties of holographic entropy inequalities [0.0]
  A holographic entropy inequality (HEI) is a linear inequality obeyed by RyuTakayanagi holographic entanglement entropies.<n>We establish a new framework for studying HEIs, and use it to prove several properties they share.
  arXiv  Detail & Related papers  (2026-01-15T02:00:00Z)
• Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness [50.78508362183774]
  Shuffling-type gradient methods are favored in practice for their simplicity and rapid empirical performance.<n>Most require the Lipschitz condition, which is often not met in common machine learning schemes.
  arXiv  Detail & Related papers  (2025-07-11T15:36:48Z)
• On the completeness of contraction map proof method for holographic entropy inequalities [0.10923877073891444]
  The contraction map proof method is the commonly used method to prove holographic entropy inequalities.<n>In this note, we answer the question in affirmative for all linear holographic entropy inequalities with rational coefficients.<n>We show that, generically, the pre-image of a non-contraction map is not a hypercube, but a proper cubical subgraph.
  arXiv  Detail & Related papers  (2025-06-22T16:21:54Z)
• Nesting is not Contracting [0.0]
  We discuss how proofs by contraction are constrained and informed by entanglement wedge nesting (EWN)<n>EWN is the property that enlarging a boundary region can only enlarge its entanglement wedge.<n>We study the recently discovered infinite families of holographic entropy inequalities.
  arXiv  Detail & Related papers  (2025-01-28T19:00:00Z)
• Inequality-free proof of Bell's theorem [0.0]
  Bell's theorem supposedly demonstrates an irreconcilable conflict between quantum mechanics and local, realistic hidden variable theories.<n>In this paper we present an alternative proof which does not involve inequalities, but only a direct comparison between correlation functions calculated using quantum mechanics on the one hand, and those calculated according to local realistic hidden-variable theories on the other.
  arXiv  Detail & Related papers  (2024-10-23T14:31:55Z)
• Taming under isoperimetry [0.0]
  In this article we propose a Langevin-based scheme calledmathbfsTULA$ to sample from distributions with growing log. We derive non-asymientKL and consequently consequently satisfy a Log-Sobolev inequality.
  arXiv  Detail & Related papers  (2023-11-15T14:44:16Z)
• Rosenthal-type inequalities for linear statistics of Markov chains [40.62675737431771]
  We establish concentration inequalities for additive functionals of geometrically ergodic Markov chains.<n>We pay special attention to the dependence of our bounds on the mixing time of the corresponding chain.
  arXiv  Detail & Related papers  (2023-03-10T10:24:46Z)
• H\"older Bounds for Sensitivity Analysis in Causal Reasoning [66.00472443147781]
  We derive a set of bounds on the confounding bias |E[Y|T=t]-E[Y|do(T=t)]| based on the degree of unmeasured confounding. These bounds are tight either when U is independent of T or when U is independent of Y given T.
  arXiv  Detail & Related papers  (2021-07-09T20:26:36Z)
• R\'enyi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations [91.3755431537592]
  We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence. We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
  arXiv  Detail & Related papers  (2021-06-19T04:06:23Z)
• Testing for Outliers with Conformal p-values [14.158078752410182]
  The goal is to test whether new independent samples belong to the same distribution as a reference data set or are outliers. We propose a solution based on conformal inference, a broadly applicable framework which yields p-values that are marginally valid but mutually dependent for different test points. We prove these p-values are positively dependent and enable exact false discovery rate control, although in a relatively weak marginal sense.
  arXiv  Detail & Related papers  (2021-04-16T17:59:21Z)
• A Unified Joint Maximum Mean Discrepancy for Domain Adaptation [73.44809425486767]
  This paper theoretically derives a unified form of JMMD that is easy to optimize. From the revealed unified JMMD, we illustrate that JMMD degrades the feature-label dependence that benefits to classification. We propose a novel MMD matrix to promote the dependence, and devise a novel label kernel that is robust to label distribution shift.
  arXiv  Detail & Related papers  (2021-01-25T09:46:14Z)
• Matrix Product Density Operators: when do they have a local parent Hamiltonian? [59.4615582291211]
  We study whether one can write a Matrix Product Density Operator (MPDO) as the Gibbs state of a quasi-local parent Hamiltonian. We conjecture this is the case for generic MPDO and give supporting evidences.
  arXiv  Detail & Related papers  (2020-10-28T00:30:07Z)
• On the complex behaviour of the density in composite quantum systems [62.997667081978825]
  We study how the probability of presence of a particle is distributed between the two parts of a composite fermionic system. We prove that it is a non-perturbative property and we find out a large/small coupling constant duality. Inspired by the proof of KAM theorem, we are able to deal with this problem by introducing a cut-off in energies that eliminates these small denominators.
  arXiv  Detail & Related papers  (2020-04-14T21:41:15Z)

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.