arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03605cond-mat.stat-mech
收藏

吝啬的引擎:第一部分:物理系统中计算速率的限制

Engines of Parsimony: Part I; Limits on Computational Rates in Physical Systems

Hannah Earley

摘要:

我们分析了最大可实现的持续计算率为一个给定的凸区域的三维空间的几何约束的功率传输和散热。我们发现一个通用的上限跨越量子和经典系统,缩放为$\sqrt{AV}$,其中$V$是区域体积和$A$其面积。达到这个界限需要使用可逆计算,否则它将下降到缩放为$A$。通过专门的布朗经典系统的情况下,我们的分析,我们也给出了一个半建设性的证明暗示实现这些界限的分子计算机。对于天文尺度的区域,广义相对论效应变得显著,并且发现与$\sqrt{AR}$和$R$成比例的更严格的界限适用,其中$R$是其半径。它还表明,在计算结构的不均匀性一般是要避免的。这些结果如图1所示。

英文摘要:

We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both quantum and classical systems, scaling as $\sqrt{AV}$ where $V$ is the region volume and $A$ its area. Attaining this bound requires the use of reversible computation, else it falls to scaling as $A$. By specialising our analysis to the case of Brownian classical systems, we also give a semi-constructive proof suggestive of an implementation attaining these bounds by means of molecular computers. For regions of astronomical size, general relativistic effects become significant and more restrictive bounds proportional to $\sqrt{AR}$ and $R$ are found to apply, where $R$ is its radius. It is also shown that inhomogeneity in computational structure is generally to be avoided. These results are depicted graphically in Figure 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑