按年被提到
20142014 · 1 次2026
物理与量子›曲速引擎与黑洞物理·arXiv:1402.5674 · hep-th

Computational Complexity and Black Hole Horizons

Leonard Susskind · 2014
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2014-04-11 · 最近 2016-06-16
2不同的人
2活跃月份
2讨论串
23被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that while creating firewalls is possible, it is extremely difficult and probably impossible for black holes that form in sudden collapse, and then evaporate. On the other hand if the radiation is bottled up then after an exponentially long period of time firewalls may be common. It is possible that gravity will provide tools to study problems of complexity; especially the range of complexity between scrambling and exponential complexity.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论dmunoz · 2014-04

“> What’s more, there are recent developments in quantum gravity that seem to support the opposite conclusion: that is, they hint that a standard quantum computer could efficiently simulate even quantum-gravitational processes, like the formation and evaporation of black holes. Most notably, the AdS/CFT correspondence, which emerged from string theory, pos…”

Is There Anything Beyond Quantum Computing?原评论 ↗
评论gone35 · 2016-06

“So, is there a physical effect that cares about computational complexity? Or a phenomenon in which it matters that we can simulate it in "only" O(n^100), not O(2^n)? Firewalls[1,2], for starters. [1] http://arxiv.org/abs/1301.4504v4 [2] http://arxiv.org/abs/1402.5674”

Why Philosophers Should Care About Computational Complexity (2011) [pdf]原评论 ↗