“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”
Quantum Computation vs. Firewalls
In this paper we discuss quantum computational restrictions on the types of thought experiments recently used by Almheiri, Marolf, Polchinski, and Sully to argue against the smoothness of black hole horizons. We argue that the quantum computations required to do these experiments take a time which is exponential in the entropy of the black hole under study, and we show that for a wide variety of black holes this prevents the experiments from being done. We interpret our results as motivating a broader type of non-locality than is usually considered in the context of black hole thought experiments, and claim that once this type of non-locality is allowed there may be no need for firewalls. Our results do not threaten the unitarity of of black hole evaporation or the ability of advanced civilizations to test it.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“https://arxiv.org/abs/1301.4504 quantum computation complexity prevents hawking radiation from being decoded before the black hole evaporates!”