On the evolution of operator complexity beyond scrambling

By J. Barbón, E. Rabinovici, R. Shir, R. Sinha. Journal of High Energy Physics, 2019

188 citations recorded by the source corpus.

A bstractWe study operator complexity on various time scales with emphasis on those much larger than the scrambling period. We use, for systems with a large but finite number of degrees of freedom, the notion of K-complexity employed in [1] for infinite systems. We present evidence that K-complexity of ETH operators has indeed the character associated with the bulk time evolution of extremal volumes and actions. Namely, after a period of exponential growth during the scrambling period the K-complexity increases only linearly with time for exponentially long times in terms of the entropy, and it eventually saturates at a constant value also exponential in terms of the entropy. This constant value depends on the Hamiltonian and the operator but not on any extrinsic tolerance parameter. Thus K-complexity deserves to be an entry in the AdS/CFT dictionary. Invoking a concept of K-entropy and some numerical examples we also discuss the extent to which the long period of linear complexity growth entails an efficient randomization of operators.

Subfields: Applied Mathematics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/a32fa3a44cf140c5bb0d417f363770fcc21288b2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. M. Smolkin
  2. Anatoly Dymarsky
  3. Rafael A. Porto

In Mathematical Physics

  1. J. Sonner
  2. Anatoly Dymarsky

Citations in the corpus