Exploring the holographic entropy cone via reinforcement learning

Abstract

We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the $\mathsf{N}=3$ cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the $\mathsf{N}=6$ cone, analyzing the 6 "mystery" extreme rays of the subadditivity cone from arXiv:2412.15364 that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for $\mathsf{N}=6$.

39 pages, 10 figures, 2 tables; v2: minor clarifications, version appearing in JHEP

References in corpus (31)

• Holographic Derivation of Entanglement Entropy from AdS/CFT
• Holographic Mutual Information is Monogamous
• The Holographic Entropy Cone
• Bit threads and holographic entanglement
• Branes with Brains: Exploring String Vacua with Deep Reinforcement Learning
• Riemannian and Lorentzian flow-cut theorems
• Bit Threads and Holographic Monogamy
• Bit threads and holographic entanglement of purification
• Holographic Entropy Relations Repackaged
• Covariant bit threads
• Crossing versus locking: Bit threads and continuum multiflows
• Superbalance of Holographic Entropy Inequalities
• On the foundations and extremal structure of the holographic entropy cone
• The Quantum Entropy Cone of Hypergraphs
• A holographic inequality for $N=7$ regions
• Holographic Entropy Inequalities and Multipartite Entanglement
• The Symmetrized Holographic Entropy Cone
• The holographic entropy cone from marginal independence
• Holographic Cone of Average Entropies
• Hypergraph min-cuts from quantum entropies
• Topological Link Models of Multipartite Entanglement
• On the relation between the subadditivity cone and the quantum entropy cone
• Two infinite families of facets of the holographic entropy cone
• Properties of the contraction map for holographic entanglement entropy inequalities
• Towards a complete classification of holographic entropy inequalities
• A gap between holographic and quantum mechanical extreme rays of the subadditivity cone
• Inner bounding the quantum entropy cone with subadditivity and subsystem coarse grainings
• Beyond the Holographic Entropy Cone via Cycle Flows
• Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the $\mathsf{N}=6$ solution
• A new characterization of the holographic entropy cone
• On the completeness of contraction map proof method for holographic entropy inequalities