Papers
Topics
Authors
Recent
2000 character limit reached

Krylov complexity in conformal field theory

Published 19 Apr 2021 in hep-th and cond-mat.stat-mech | (2104.09514v1)

Abstract: 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.

Citations (115)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.