The paper establishes a Lie-algebraic framework for exact Krylov dynamics in time-dependent quantum systems and introduces a quantum speed limit for complexity growth that retains its time-independent form but saturates only when the Hamiltonian commutes with itself at different times.
Geometry of Krylov complexity
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 4representative citing papers
In the BMN matrix model and its holographic duals, Krylov basis states and Lanczos coefficients are uniquely fixed by the model's mass parameter.
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.
citing papers explorer
-
Krylov Dynamics and Operator Growth in Time-Dependent Systems via Lie Algebras
The paper establishes a Lie-algebraic framework for exact Krylov dynamics in time-dependent quantum systems and introduces a quantum speed limit for complexity growth that retains its time-independent form but saturates only when the Hamiltonian commutes with itself at different times.
-
Krylov complexity for Lin-Maldacena geometries and their holographic duals
In the BMN matrix model and its holographic duals, Krylov basis states and Lanczos coefficients are uniquely fixed by the model's mass parameter.
-
Krylov Complexity
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
-
Quantum Dynamics in Krylov Space: Methods and Applications
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.