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

共形场论中的Krylov复杂性

Krylov complexity in conformal field theory

Anatoly Dymarsky, Michael Smolkin

摘要:

Krylov复杂性,或简称K-复杂性,是最近出现的一种新的量子系统中的混沌探测。它是Krylov空间中算子增长的一种度量,它严格限制了由时间外有序相关器(OTOC)测量的算子增长。我们通过考虑任意二维CFTs、自由场和全息模型研究了共形场论中的Krylov复杂性。我们发现,OTOC的Krylov复杂性提供的限制减少到马尔达塞纳,申克,斯坦福大学的混沌。在所有考虑的例子中,包括自由和理性的CFTs,克雷洛夫复杂性呈指数增长,完全违反了指数增长意味着混乱的预期。

英文摘要:

Krylov complexity, or K-complexity for short, has recently emerged as a new probe of chaos in quantum systems. It is a measure of operator growth in Krylov space, which conjecturally bounds the operator growth measured by the out of time ordered correlator (OTOC). We study Krylov complexity in conformal field theories by considering arbitrary 2d CFTs, free field, and holographic models. We find that the bound on OTOC provided by Krylov complexity reduces to bound on chaos of Maldacena, Shenker, and Stanford. In all considered examples including free and rational CFTs Krylov complexity grows exponentially, in stark violation of the expectation that exponential growth signifies chaos.

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

↑