Signatures of quantum chaos and complexity in the Ising model on random graphs
GJ Sreejith, Sandipan Manna

TL;DR
This paper explores how the quantum Ising model on random graphs exhibits a transition from localized to chaotic behavior as connectivity varies, using scalable probes relevant for near-term quantum devices.
Contribution
It introduces scalable experimental diagnostics to identify quantum chaos and complexity in the Ising model on random graphs, bridging theory and near-term quantum experiments.
Findings
Signatures of chaos are observed at intermediate connectivities.
Deep thermalization occurs faster at intermediate connectivities.
Krylov complexity peaks in the chaotic regime.
Abstract
We investigate signatures of quantum chaos in the mixed-field quantum Ising model on finite-size Erd\H{o}s-R\'enyi graphs using probes scalable on near-term quantum devices. By tuning the graph connectivity, the system exhibits a crossover from a localized regime at low connectivity, through a chaotic regime at intermediate connectivity, to a permutation-symmetric integrable limit near all-to-all connectivity. This crossover has possible implications for the performance and trainability of variational algorithms such as QAOA. We characterize this crossover using complementary probes. First, deep thermalization of a projected ensemble starting from a product state reveals slow (fast) convergence to the Haar ensemble at extremal (intermediate) connectivities. Secondly, we analyze eigenstate and eigenvalue correlations using the partial spectral form factor, an experimentally scalable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
