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

On Maximum Complexity in Holography

Shahrokh Parvizi, Mojtaba Shahbazi

英文摘要:

In a quantum circuit, it is believed that complexity itself reaches a maximum of order exponential in the number of q-bits or equivalently exponential in entropy of the black hole. However, the current holographic proposals do not meet this criterion. The holographic proposals find the complexity of the very late times to be linear in the entropy, while in the quantum circuit, it is expected that complexity meets within a finite time its maximum value in an exponential in the entropy. These points are required to be altered in holographic proposals of complexity. This paper introduces a new holographic proposal that meets this criterion and consolidates the Lloyd bound.

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

↑