arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.15832hep-th
收藏

模拟引力中的计算复杂性

Computational Complexity in Analogue Gravity

Shahrokh Parvizi, Mojtaba Shahbazi

AI总结:

本研究在模拟引力框架下为凝聚态系统的计算复杂性建立诠释,找到对应Lloyd界的不确定性原理模拟形式,证明其与流体/引力对偶的KSS界近似等价,并给出实验室检验Lloyd界的实验判据。

摘要:

模拟引力有助于找到与凝聚态系统中微扰演化相似的引力系统,这类类比为双方提供了极佳工具,换言之,引力的某些方面可在凝聚态实验室中被模拟。本研究中,我们将为凝聚态系统中的计算复杂性找到一种诠释,并找到作为Lloyd界的不确定性原理的模拟形式。我们证明该不等式大致等价于流体/引力对偶中的KSS界,并为在实验室中检验Lloyd界提供了若干实验判据。

英文摘要:

Analogue gravity helps to find some gravitational systems which are similar to the evolution of perturbation in condensed matter systems. These analogies provide a very good tool for either side. In other words, some aspects of gravity could be simulated in condensed matter laboratories. In this study, we are going to find an interpretation for computational complexity in condensed matter systems and the analogue of the uncertainty principle as the Lloyd bound. We show that this inequality roughly is equivalent to the KSS bound in the fluid/gravity duality and provides some experimental criteria to test the Lloyd bound in the laboratory.

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

↑