The growth of operator entropy in operator growth

  title={The growth of operator entropy in operator growth},
  author={Zhong Fan},
  journal={Journal of High Energy Physics},
  • Z. Fan
  • Published 2 June 2022
  • Computer Science
  • Journal of High Energy Physics
We study upper bounds on the growth of operator entropy S K in operator growth. Using uncertainty relation, we first prove a dispersion bound on the growth rate |∂ t S K | ≤ 2 b 1 ∆ S K , where b 1 is the first Lanczos coefficient and ∆ S K is the variance of S K . However, for irreversible process, this bound generally turns out to be too loose at long times. We further find a tighter bound in the long time limit using a universal logarithmic relation between Krylov complexity and operator… 
2 Citations

Krylov complexity in large-$q$ and double-scaled SYK model

: Considering the large- q expansion of the Sachdev-Ye-Kitaev (SYK) model in the two-stage limit, we compute the Lanczos coefficients, Krylov complexity, and the higher Krylov cumulants in subleading

A Tale of Two Hungarians: Tridiagonalizing Random Matrices

The Hungarian physicist Eugene Wigner introduced random matrix models in physics to describe the energy spectra of atomic nuclei. As such, the main goal of Random Matrix Theory (RMT) has been to



On the evolution of operator complexity beyond scrambling

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,

Quantum chaos and the complexity of spread of states

A measure of quantum state complexity is proposed by minimizing the spread of the wavefunction over all choices of basis by controlling the “survival amplitude” for a state to remain unchanged, and can be computed in theories with discrete spectra.

Ultimate Physical Limits to the Growth of Operator Complexity

A fundamental and universal limit to the growth of the Kryov complexity is introduced by formulating a Robertson uncertainty relation, involving the Krylov complexity operator and the Liouvillian, as generator of time evolution.

Ultimate speed limits to the growth of operator complexity

A rigorous bound on the Krylov complexity growth rate is established based on the uncertainty principle and it is shown that the presence of quantum chaos is not strictly necessary to saturation of the bound.

Probing the entanglement of operator growth

This work argues that the use of the Lanczos algorithm can be circumvented and all the essential information can be extracted directly from symmetry arguments, and the utility of this approach relying on symmetry as it significantly facilitates the calculation of quantities probing operator growth.

Operator delocalization in quantum networks

Joonho Kim, ∗ Jeff Murugan, † Jan Olle, ‡ and Dario Rosa § Institute for Advanced Study, Princeton, NJ 08540, USA The Laboratory for Quantum Gravity & Strings, Department of Mathematics and Applied

Geometry of Krylov complexity

A geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries is developed and techniques from quantum optics are used to study operator evolution with quantum information tools such as entanglement and Renyi entropies, negativity, fidelity, relative entropy and capacity ofEntanglement.

Krylov complexity in conformal field theory

It is found that the bound on OTOC provided by Krylov complexity reduces to bound on chaos of Maldacena, Shenker, and Stanford, in stark violation of the expectation that exponential growth signifies chaos.

Operator complexity: a journey to the edge of Krylov space

This work proves rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, undertake a detailed numerical study of these quantities in the SYK4 model, which is maximally chaotic, and compare the results with theSYK2 model,Which is integrable.

Complexity growth of operators in the SYK model and in JT gravity

The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving