Pith. sign in

REVIEW

Improved proof-by-contraction method and relative homologous 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

arxiv 2204.03192 v2 pith:IJHG3SWS submitted 2022-04-07 hep-th gr-qcmath-phmath.MP

Improved proof-by-contraction method and relative homologous entropy inequalities

classification hep-th gr-qcmath-phmath.MP
keywords entropyholographicquantumentanglementstatecaseseffectivegiven
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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 allows us to diagnose whether a given quantum state is a holographic state, a state whose bulk dual admits semiclassical geometrical description. The effective tool of this kind of diagnosis is holographic entropy cone (HEC), an entropy space bounded by holographic entropy inequalities allowed by the theory. To fix the HEC and to prove a given holographic entropy inequality, a proof-by-contraction technique has been developed. This method heavily depends on a contraction map $f$, which is very difficult to construct especially for more-region ($n\geq 4$) cases. In this work, we develop a general and effective rule to rule out most of the cases such that $f$ can be obtained in a relatively simple way. In addition, we extend the whole framework to relative homologous entropy, a generalization of holographic entanglement entropy that is suitable for characterizing the entanglement of mixed states.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.