Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
Entanglement is not enough
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Scalar hair breaks the time-independence of imaginary HTEE, introduces nontrivial Δt dependence, causes analytic continuation to fail, and makes timelike subregion complexity real-valued with interior-only UV-finite contributions in BTZ.
citing papers explorer
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
Holographic timelike entanglement and subregion complexity with scalar hair
Scalar hair breaks the time-independence of imaginary HTEE, introduces nontrivial Δt dependence, causes analytic continuation to fail, and makes timelike subregion complexity real-valued with interior-only UV-finite contributions in BTZ.