REVIEW 2 cited by
Dissecting Quantum Many-body Chaos in the Krylov Space
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is established that the out-of-time-order correlator serves as the signature of quantum many-body chaos, while the Krylov complexity provides its upper bound. However, there exist non-chaotic systems in which Krylov complexity grows exponentially, indicating that the Krylov complexity itself is not a witness of many-body chaos. In this letter, we introduce the missing ingredient, named as the Krylov metric $K_{mn}$, which probes the size of the Krylov basis. We propose that the universal criteria for fast scramblers include (i) the exponential growth of Krylov complexity, (ii) the diagonal elements $K_{nn}\sim n^h$ with $h\in(0,1]$, and (iii) the negligibility of off-diagonal elements $K_{mn}$ with $m\neq n$. We further show that $h=\varkappa / 2\alpha$ is a ratio between the quantum Lyapunov exponent $\varkappa$ and the Krylov exponent $\alpha$. This proposal is supported by both generic arguments and explicit examples, including solvable SYK models, Luttinger Liquids, and many-body localized systems. Our results provide a refined understanding of how chaotic dynamics emerge from the Krylov space perspective.
Forward citations
Cited by 2 Pith papers
-
Brickwall One-Loop Determinant: Spectral Statistics & Krylov Complexity
In the brickwall model of a BTZ black hole, hand-tuned Gaussian randomness at a stretched horizon reproduces random-matrix-theory spectral statistics and Krylov complexity peaks for scalar and fermionic probes.
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
Discussion (0). Continue with ORCID to comment.