Time evolution of the complexity in chaotic systems: concrete examples
Run-Qiu Yang, Keun-Young Kim
TL;DR
This work challenges the view that bi-invariant complexity cannot display the canonical chaotic-growth behavior by analyzing the SYK model under a fixed total energy. Using Nielsen's complexity geometry with a non-Riemannian (Finsler), bi-invariant metric, the authors demonstrate linear growth up to $t \sim e^{N}$, followed by saturation and small fluctuations, and show that Lloyd's bound is realized. They argue that unitary invariance enforces left/right complexity equivalence, making bi-invariant complexity a natural candidate for QM/QFT complexity, and that the $p=1$ case uniquely preserves a finite growth rate at large $N$. The results emphasize that fixing total energy, rather than coupling, is crucial for obtaining the expected exponential-time growth, and they highlight the fundamental role of non-Riemannian Finsler geometry in this context.
Abstract
We investigate the time evolution of the complexity of the operator by the Sachdev-Ye-Kitaev (SYK) model with $N$ Majorana fermions. We follow Nielsen's idea of complexity geometry and geodesics thereof. We show that it is possible that the bi-invariant complexity geometry can exhibit the conjectured time evolution of the complexity in chaotic systems: i) linear growth until $t\sim e^{N}$, ii) saturation and small fluctuations after then. We also show that the Lloyd's bound is realized in this model. Interestingly, these characteristic features appear only if the complexity geometry is the most natural "non-Riemannian" Finsler geometry. This serves as a concrete example showing that the bi-invariant complexity may be a competitive candidate for the complexity in quantum mechanics/field theory (QM/QFT). We provide another argument showing a naturalness of bi-invariant complexity in QM/QFT. That is that the bi-invariance naturally implies the equivalence of the right-invariant complexity and left-invariant complexity, either of which may correspond to the complexity of a given operator. Without bi-invariance, one needs to answer why only right (left) invariant complexity corresponds to the "complexity", instead of only left (right) invariant complexity.
