REVIEW 5 cited by
Krylov complexity from integrability to chaos
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
read the original abstract
We apply a notion of quantum complexity, called "Krylov complexity", to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking deformation that allows one to interpolate between integrable and chaotic behavior. K-complexity can act as a probe of the integrable or chaotic nature of the underlying system via its late-time saturation value that is suppressed in the integrable phase and increases as the system is driven to the chaotic phase. We furthermore ascribe the (under-)saturation of the late-time bound to the amount of disorder present in the Lanczos sequence, by mapping the complexity evolution to an auxiliary off-diagonal Anderson hopping model. We compare the late-time saturation of K-complexity in the chaotic phase with that of random matrix ensembles and find that the chaotic system indeed approaches the RMT behavior in the appropriate symmetry class. We investigate the dependence of the results on the two key ingredients of K-complexity: the dynamics of the Hamiltonian and the character of the operator whose time dependence is followed.
Forward citations
Cited by 5 Pith papers
-
Black Hole States in Quantum Spin Chains
An equal-weight superposition of all non-crossing singlet pairings in a Heisenberg chain shows logarithmic entanglement growth (c≈5.2) and near-infinite-temperature thermalization.
-
Krylov Complexity of Supersymmetric SYK Models
In finite-size N=2 SYK, breaking supersymmetry with an irrelevant deformation pushes late-time Krylov complexity to roughly half the maximal Krylov-space bound, while a mass deformation leaves saturation complexity a ...
-
Complexity of PXP scars revisited
In the PXP model, the arch in the Lanczos coefficients is traced to a linear sl(3) part of the Hamiltonian, and the arch width is proposed as a signal distinguishing scarred from thermalizing states.
-
The Information Content of Krylov Observables: A Machine Learning Approach
Under chaos, the normalized Wigner negativity χ(t) carries information about the fine return dynamics that spread complexity C(t) cannot, with the asymmetry gap rising from +0.33 to +0.77 across the integrable-to-GUE ...
-
Quasinormal modes and complexity in saddle-dominated SU(N) spin systems
A family of SU(2) and SU(3) Lipkin-Meshkov-Glick-type Hamiltonians reproduces de Sitter quasinormal-mode densities of states, and late-time probes reveal integrability beneath saddle-dominated scrambling.
Discussion (0). Sign in to comment.