REVIEW 5 cited by
Krylov complexity in the IP matrix model II
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
We continue the analysis of the Krylov complexity in the IP matrix model. In a previous paper, for a fundamental operator, it was shown that at zero temperature, the Krylov complexity oscillates and does not grow, but in the infinite temperature limit, the Krylov complexity grows exponentially in time as $\sim \exp\left( {\mathcal{O}\left( {\sqrt{t}}\right)} \right)$. We study how the Krylov complexity changes from a zero-temperature oscillation to an infinite-temperature exponential growth. At low temperatures, the spectral density is approximated as collections of infinite Wigner semicircles. We showed that this infinite collection of branch cuts yields linear growth to the Lanczos coefficients and gives exponential growth of the Krylov complexity. Thus the IP model for any nonzero temperature shows exponential growth for the Krylov complexity even though the Green function decays by a power law in time. We also study the Lanczos coefficients and the Krylov complexity in the IOP matrix model taking into account the $1/N^2$ corrections. There, the Lanczos coefficients are constants and the Krylov complexity does not grow exponentially as expected.
Forward citations
Cited by 5 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.
-
Generalized Krylov Complexity
The paper defines generalized Krylov complexity for multi-generator unitary evolutions, computes it for U(1)xU(1), a U(1)xU(1) subgroup of SO(10), and SU(2), and introduces a weighted version.
-
Dynamics of monitored SSH Model in Krylov Space: From Complexity to Quantum Fisher Information
Time-averaged quantum Fisher information in Krylov space changes slope at the PT transition (gamma=1) and saturates near the entanglement transition (gamma=2) in the monitored SSH model, suggesting it as a probe of both.
-
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.