REVIEW 3 cited by
Generalised Krylov complexity
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
read the original abstract
In this paper, we studied a set of generalised Krylov complexity for operator growth. We demonstrate their universal features at both initial times and long times using half-analytical technique as well as numerical results. In particular, by using the logarithmic relation to the Krylov entropy, we establish an inequality (\ref{master}) between the variance of the K-complexity and the generalised notions which holds in the long time limit. Extending the result to finite (but long) times, we show that for fast scramblers, the K-complexity constrains the growth of generalised complexity more stringently than the dispersion bound. However, for slow scramblers, the growth rate of K-complexity is tighter bounded by the generalised complexity in the other way around. Our results enlarge the zoo of Krylov quantities and may shed new light on the future research in this field.
Forward citations
Cited by 3 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.
-
Higher-Order Krylov State Complexity in Random Matrix Quenches
Higher-order generalized spread complexities show a more pronounced pre-equilibration peak than standard spread complexity in random matrix quenches, quantifying chaos more sharply up to third order.
-
Statistics and Complexity of Wavefunction Spreading in Quantum Dynamical Systems
The moments of the spreading-operator measurement distribution are generalized spread complexities, which for GUE Hamiltonians peak more sharply at higher order and obey a norm bound.
Discussion (0). Continue with ORCID to comment.