For strip-shaped CFT_d systems, bath-pair entropy peaks at a generalized golden-ratio critical size, then falls through an exactly resummed island entropy term, with far-separated mutual information decaying as 1 over distance to the power d.
Thoughts on Holographic Complexity and its Basis-dependence
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this minimality, it satisfies the triangle inequality, and can be regarded as a (discrete version of) distance in the Hilbert space. However, we show a no-go theorem that any basis-independent distance cannot reproduce the behavior of the holographic complexity. Therefore, if holographic complexity is dual to a distance in the Hilbert space, it should be basis-dependent, i.e., it is not invariant under a change of the basis of the Hilbert space.
fields
hep-th 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Exact islands scenario for CFT systems and critical ratios in higher geometry
For strip-shaped CFT_d systems, bath-pair entropy peaks at a generalized golden-ratio critical size, then falls through an exactly resummed island entropy term, with far-separated mutual information decaying as 1 over distance to the power d.