Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subleading Bounds on Chaos

Published 8 Sep 2021 in hep-th, cond-mat.stat-mech, gr-qc, nlin.CD, and quant-ph | (2109.03826v2)

Abstract: Chaos, in quantum systems, can be diagnosed by certain out-of-time-order correlators (OTOCs) that obey the chaos bound of Maldacena, Shenker, and Stanford (MSS). We begin by deriving a dispersion relation for this class of OTOCs, implying that they must satisfy many more constraints beyond the MSS bound. Motivated by this observation, we perform a systematic analysis obtaining an infinite set of constraints on the OTOC. This infinite set includes the MSS bound as the leading constraint. In addition, it also contains subleading bounds that are highly constraining, especially when the MSS bound is saturated by the leading term. These new bounds, among other things, imply that the MSS bound cannot be exactly saturated over any duration of time, however short. Furthermore, we derive a sharp bound on the Lyapunov exponent $\lambda_2 \le \frac{6\pi}{\beta}$ of the subleading correction to maximal chaos.

Citations (16)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Authors (1)

Collections

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