Related papers: Exploring the holographic entropy cone via reinfor…
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,…
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 study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner queries subsets of vertices of a hidden hypergraph and observes whether these subsets contain an edge or not. In general, learning a…
For minimally rigid graphs, the same edge-length data can admit multiple realizations (up to translations and rotations). Finding graphs with exceptionally many realizations is an extremal problem in rigidity theory, but exhaustive search…
We investigate the Holographic Entanglement Entropy proposal in the context of the (3+1)-dimensional topological black hole. In contrast to the well-studied (2+1)-dimensional case, the maximal extension for this black hole includes only a…
This is an extended version of our short report hep-th/0603001, where a holographic interpretation of entanglement entropy in conformal field theories is proposed from AdS/CFT correspondence. In addition to a concise review of relevant…
We explore the structure of holographic entropy relations (associated with 'information quantities' given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy…
A fundamental question in reinforcement learning theory is: suppose the optimal value functions are linear in given features, can we learn them efficiently? This problem's counterpart in supervised learning, linear regression, can be solved…
In a hyper-relational knowledge graph (HKG), each fact is composed of a main triple associated with attribute-value qualifiers, which express additional factual knowledge. The hyper-relational knowledge graph completion (HKGC) task aims at…
We apply machine learning to understand fundamental aspects of holographic duality, specifically the entropies obtained from the apparent and event horizon areas. We show that simple features of only the time series of the pressure…
We examine the holographic entanglement entropy in hyperscaling violating backgrounds. Precisely in such theories by semi-analytic computation, we use holographic methods to derive the universal terms of entanglement entropy in various…
We study the holographic entanglement entropy of spatial regions having arbitrary shapes in the AdS4/BCFT3 correspondence with static gravitational backgrounds, focusing on the subleading term with respect to the area law term in its…
In this work, we develop a systematic formalism to evaluate the upper bound of a large family of holographic entanglement entropy combinations when fixing $n$ subsystems and fine-tuning one other subsystem. The upper bound configurations…
Significant work has gone into determining the minimal set of entropy inequalities that determine the holographic entropy cone. Holographic systems with three or more parties have been shown to obey additional inequalities that generic…
We study holographic entanglement entropy in four-dimensional quantum gravity with negative cosmological constant. By using the replica trick and evaluating path integrals in the minisuperspace approximation, in conjunction with the…
We study the holographic entanglement entropy for singular surfaces in theories described holographically by hyperscaling violating backgrounds. We consider singular surfaces consisting of cones or creases in diverse dimensions. The…
The holographic entropy cone (HEC) characterizes the entanglement structure of quantum states which admit geometric bulk duals in holography. Due to its intrinsic complexity, to date it has only been possible to completely characterize the…
This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs…
We consider holographic entanglement entropy in AdS black hole backgrounds by using the limit of large number of dimensions. By dividing the geometry to two patches (with one patch covering the vicinity of the black hole horizon and another…
We introduce a reinforcement learning algorithm designed to identify the fixed points of a given quantum operation. The method iteratively constructs the unitary transformation that maps the computational basis onto the basis of fixed…