REVIEW 5 cited by
Krylov Complexity and Spectral Form Factor for Noisy Random Matrix Models
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
We study the spectral properties of two classes of random matrix models: non-Gaussian RMT with quartic and sextic potentials, and RMT with Gaussian noise. We compute and analyze the quantum Krylov complexity and the spectral form factor for both of these models. We find that both models show suppression of the spectral form factor at short times due to decoherence effects, but they differ in their long-time behavior. In particular, we show that the Krylov complexity for the non-Gaussian RMT and RMT with noise deviates from that of a Gaussian RMT. We discuss the implications and limitations of our results for quantum chaos and quantum information in open quantum systems. Our study reveals the distinct sensitivities of the spectral form factor and complexity to non-Gaussianity and noise, which contribute to the observed differences in the different time domains.
Forward citations
Cited by 5 Pith papers
-
Analytic Spread Complexity from Level Statistics: From Chaos to Integrability
The finite-time peak of spread complexity is controlled by the Fourier transform of the nearest-neighbour energy-level spacing distribution.
-
Krylov Complexity in Mixed Phase Space
The Krylov complexity peak height correlates with the Brody parameter in mixed-phase-space quantum systems, diminishing as the spectrum becomes Poissonian.
-
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.