Ultimate Speed Limits to the Growth of Operator Complexity
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QLFQLJRNrecord.jsonopen to challenge →
read the original abstract
In an isolated system, the time evolution of a given observable in the Heisenberg picture can be efficiently represented in Krylov space. In this representation, an initial operator becomes increasingly complex as time goes by, a feature that can be quantified by the Krylov complexity. We introduce a fundamental and universal limit to the growth of the Krylov complexity by formulating a Robertson uncertainty relation, involving the Krylov complexity operator and the Liouvillian, as generator of time evolution. We further show the conditions for this bound to be saturated and illustrate its validity in paradigmatic models of quantum chaos.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity
Polynomial changes of the initial state in Krylov complexity are solved exactly via Christoffel transforms of the spectral measure, yielding finite-band amplitude transfer and projected-kernel complexity formulas with...
-
Cosmological Entanglement Entropy from the von Neumann Algebra of Double-Scaled SYK & Its Connection with Krylov Complexity
Algebraic entanglement entropy from type II1 algebras in double-scaled SYK is matched via triple-scaling limits to Ryu-Takayanagi areas in (A)dS2, reproducing Bekenstein-Hawking and Gibbons-Hawking formulas for specif...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.