Learning SYK Hamiltonians
Anurag Anshu, Srinivasan Arunachalam, Sitan Chen, Yeongwoo Hwang
Abstract
We study the problem of learning the dense Sachdev--Ye--Kitaev (SYK) Hamiltonian from copies of its Gibbs state. Existing algorithms for Hamiltonian learning typically rely on geometric locality or bounded interaction degree and therefore do not apply to SYK, where each quartic interaction overlaps with Θ(n3) others. We show that this obstruction can be overcome by exploiting the random mean-field structure of the model. At any constant temperature, we prove that with high probability over the SYK couplings, the entire Hamiltonian can be learned to inverse-polynomial accuracy using polynomially many samples. Furthermore, when the inverse temperature is restricted to be a sufficiently small constant, we construct a quasipolynomial-time learning algorithm which is qualitatively different from the sample-efficient algorithm.
Create a lesson
Related papers
Single-Particle Spectral Estimation
Adrian Chapman, Charles Derby, Steven T. Flammia et al.
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Fuchuan Wei, Kong-Wing Wu, Zhengwei Liu et al.
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh et al.
Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
Omar Al-Ghattas, David Gamarnik, Bobak T Kiani
Learning Many-Body Hamiltonians Using a Local Probe
Suying Liu, Zitai Xu, Alexey V. Gorshkov et al.