Krylov complexity's Taylor coefficients recursively determine all Lanczos coefficients, making it a complete descriptor of operator dynamics, with caveats for spread complexity.
A universal approach to Krylov state and operator complexities,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Krylov complexity has it all
Krylov complexity's Taylor coefficients recursively determine all Lanczos coefficients, making it a complete descriptor of operator dynamics, with caveats for spread complexity.
-
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.