LogK complexity via replicas distinguishes genuine scrambling from saddle effects in quantum and classical systems and refines the measure for integrable cases.
Title resolution pending
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 2verdicts
UNVERDICTED 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
-
Towards a Refinement of Krylov Complexity: Scrambling, Classical Operator Growth and Replicas
LogK complexity via replicas distinguishes genuine scrambling from saddle effects in quantum and classical systems and refines the measure for integrable cases.
-
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.