REVIEW 7 cited by
Towards a complete classification of holographic entropy inequalities
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
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 and partial cubes. More specifically, the validity of a holographic entropy inequality is implied by the existence of a contraction map, which we prove to be equivalent to finding an isometric embedding of a contracted graph. Thus, by virtue of the argued completeness of the contraction map proof method, the problem of finding all holographic entropy inequalities is equivalent to the problem of finding all contraction maps, which we translate to a problem of finding all image graph partial cubes. We give an algorithmic solution to this problem and characterize the complexity of our method. We also demonstrate interesting by-products, most notably, a procedure to generate candidate quantum entropy inequalities.
Forward citations
Cited by 7 Pith papers
-
On the completeness of contraction map proof method for holographic entropy inequalities
Every valid linear holographic entropy inequality with integer coefficients has a contraction map, making the contraction-map proof method complete.
-
The Holographic Multi-Entropy Cone
Holographic multi-entropy vectors form a rational polyhedral cone; its n=3,4 facets yield seven fundamental multi-entropy inequality orbits, with ordinary HEC facets arising as convex combinations of HMEC facets.
-
Minimax surfaces and the holographic entropy cone
Stable minimax surfaces are shown to be HRT surfaces, the entanglement wedge is the smallest minimax homology region, and a cooperating time-sheet configuration would prove the equality of RT and HRT entropy cones.
-
More on the upper bound of holographic n-partite information
The upper bound of holographic conditional mutual information equals twice the entanglement of state-constrained purification and diverges in the many-interval limit, revealing abundant multipartite entanglement.
-
Combinatorial aspects of holographic quantum secret sharing
Bulk regions in AdS3/CFT2 get a holographic secret-sharing distance d and thresholds (r,s), with r = n - d + 1; pure states satisfy s = d - 1 while mixed states can satisfy s >= d.
-
Upper bound of holographic entanglement entropy combinations
The authors derive upper bounds for large families of holographic entanglement entropy combinations by fixing the connectivity of entanglement wedges and classifying gap regions.
-
Holographic Entropy Cone Beyond AdS/CFT
All known holographic entropy cone inequalities hold for generalized entanglement wedges of bulk regions in any static spacetime, subject to a mutual independence condition.
Discussion (0). Continue with ORCID to comment.