按年被提到
20092017 · 1 次2026
物理与量子›量子实验与纠缠·arXiv:0907.1579 · quant-ph

The Computational Power of Minkowski Spacetime

Jacob D. Biamonte · 2009
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2017-03-22 · 最近 2020-11-25
2不同的人
2活跃月份
2讨论串
1被引(OpenAlex)
arXiv 摘要(候选层不写导读)

The Lorentzian length of a timelike curve connecting both endpoints of a classical computation is a function of the path taken through Minkowski spacetime. The associated runtime difference is due to time-dilation: the phenomenon whereby an observer finds that another's physically identical ideal clock has ticked at a different rate than their own clock. Using ideas appearing in the framework of computational complexity theory, time-dilation is quantified as an algorithmic resource by relating relativistic energy to an $n$th order polynomial time reduction at the completion of an observer's journey. These results enable a comparison between the optimal quadratic \emph{Grover speedup} from quantum computing and an $n=2$ speedup using classical computers and relativistic effects. The goal is not to propose a practical model of computation, but to probe the ultimate limits physics places on computation.

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

HN 书评

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

“Try this version instead: There is a rocket to be launched for people to upload problems to solve, the rocket travels in such a way that it is able to solve all the problems and come back to tell people the solution. The way it solves the problem is by orbiting around a tiny planet full of computers devoted to compute the problems they are communicated of…”

Your yearly dose of is-the-universe-a-simulation原评论 ↗
被提交为 story · 1 次