Related papers: Algorithmic construction of SSA-compatible extreme…
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…
The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone -- the holographic entropy cone -- in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary…
In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and…
We develop a convenient framework for characterizing multipartite entanglement in composite systems, based on relations between entropies of various subsystems. This continues the program initiated in arXiv:1808.07871, of using holography…
The holographic entropy cone (HEC) is a polyhedral cone first introduced in the study of a class of quantum entropy inequalities. It admits a graph-theoretic description in terms of minimum cuts in weighted graphs, a characterization which…
It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new…
Using some adaptations of the adjacency decomposition method \cite{CR} and the program {\it cdd} (~\cite{Fu}), we compute the first computationally difficult cases of convex cones of $m$-ary and oriented analogs of semi-metrics and cut…
We initiate a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries. For 2, 3, and 4 regions, we prove that the…
The holographic entropy cone identifies entanglement entropies of field theory regions, which are consistent with representing semiclassical spacetimes under gauge/gravity duality; it is currently known up to 5 regions. We point out that…
Motivated by bit threads, we introduce a new prescription for computing entropy vectors outside the holographic entropy cone. By utilizing cycle flows on directed graphs, we show that the maximum cycle flow associated to any subset of…
We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific ``chordality'' condition first introduced in arXiv:2412.18018. We further develop…
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base…
We show via explicit construction that all the extreme rays of both the three-party quantum entropy cone and the four-party stabilizer entropy cone can be obtained from subsystem coarse grainings of specific higher-party quantum states,…
We consider a class of holographic quantum error-correcting codes, built from perfect tensors in network configurations dual to Bruhat-Tits trees and their quotients by Schottky groups corresponding to BTZ black holes. The resulting…
The problem of finding a maximum $2$-matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalized to finding a maximum $t$-matching which excludes specified…
We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…
We prove that the ``chordality condition'', which was established in arXiv:2412.18018 as a necessary condition for an entropy vector to be realizable by a holographic simple tree graph model, is also sufficient. The proof is constructive,…
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as "strong subadditivity". For a field theory this inequality can be stated as follows: given any two regions of space $A$ and…
Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high…
In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…