相关论文: Necessary and sufficient conditions for entropy ve…
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…
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 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…
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…
The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the…
We propose a deterministic method to find all holographic entropy inequalities that have corresponding contraction maps and argue the completeness of our method. We use a triality between holographic entropy inequalities, contraction maps…
The celebrated holographic entanglement entropy triggered investigations on the connections between quantum information theory and quantum gravity. An important achievement is that we have gained more insights into the quantum states. It…
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…
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…
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…
Suppose $X$ is a smooth complex algebraic variety. A necessary condition for a complex topological vector bundle on $X$ (viewed as a complex manifold) to be algebraic is that all Chern classes must be algebraic cohomology classes, i.e., lie…
We are given an integer $d$, a graph $G=(V,E)$, and a uniformly random embedding $f : V \rightarrow \{0,1\}^d$ of the vertices. We are interested in the probability that $G$ can be "realized" by a scaled Euclidean norm on $\mathbb{R}^d$, in…
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…
We construct a graph model for holographic entropies in general time-dependent spacetimes. In static settings, such models arise from Ryu-Takayanagi surfaces on a common Cauchy slice and imply that the holographic entropy cone is…
We observe that the entanglement entropy resulting from tracing over a subregion of an initially pure state can grow faster than the surface area of the subregion (indeed, proportional to the volume), in contrast to examples studied…
We present and study the following conjecture: for an integer $t\geq 4$ and a graph $H$, every even-hole-free graph of large enough treewidth has an induced subgraph isomorphic to either $K_t$ or $H$, if (and only if) $H$ is a $K_4$-free…
We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus…
In the framework of the holographic principle, focusing on a central concept, conditional mutual information, we construct a class of coarse-grained states, which are intuitively connected to a family of thread configurations. These…