Optimizing Sparse SYK

Abstract

Finding the ground state of strongly-interacting fermionic systems is often the prerequisite for fully understanding both quantum chemistry and condensed matter systems. The Sachdev--Ye--Kitaev (SYK) model is a representative example of such a system; it is particularly interesting not only due to the existence of efficient quantum algorithms preparing approximations to the ground state such as Hastings--O'Donnell (STOC 2022), but also known no-go results for many classical ansatzes in preparing low-energy states. However, this quantum-classical separation is known to \emph{not} persist when the SYK model is sufficiently sparsified, i.e., when terms in the model are discarded with probability $1-p$, where $p=\Theta (1/n^3)$ and $n$ is the system size. This raises the question of how robust the quantum and classical complexities of the SYK model are to sparsification. In this work we initiate the study of the sparse SYK model where $p\in [\Theta (1/n^3),1]$ and show there indeed exists a certain robustness of sparsification. We prove that with high probability, Gaussian states achieve only a $\Theta (1/\sqrt{n})$-factor approximation to the true ground state energy of sparse SYK for all $p\ge \Omega (\log n/n^2)$, and that Gaussian states cannot achieve constant-factor approximations unless $p\le O({\log }^{2}n/n^3)$. Additionally, we prove that the quantum algorithm of Hastings--O'Donnell still achieves a constant-factor approximation to the ground state energy when $p\ge \Omega (\log n/n)$. Combined, these show a provable separation between classical algorithms outputting Gaussian states and efficient quantum algorithms for the goal of finding approximate sparse SYK ground states whenever $p\ge \Omega (\log n/n)$, extending the analogous $p=1$ result of Hastings--O'Donnell.

v3: Formatting edits. Accepted to Quantum. 32+8 pages, 5 figures

References in corpus (18)

• Quantum Chemistry in the Age of Quantum Computing
• User-friendly tail bounds for sums of random matrices
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Quantum algorithms to simulate many-body physics of correlated fermions
• An introduction to the SYK model
• Quantum Hamiltonian Complexity
• Fermionic Gaussian states: an introduction to numerical approaches
• Exact moments of the Sachdev-Ye-Kitaev model up to order $1/N^2$
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Approximation algorithms for quantum many-body problems
• Uncertainty relations from graph theory
• Optimizing sparse fermionic Hamiltonians
• Triply efficient shadow tomography
• Variational wavefunctions for Sachdev-Ye-Kitaev models
• Bounding the joint numerical range of Pauli strings by graph parameters
• Sparse random Hamiltonians are quantumly easy
• Analysis of the Disorder-Induced Zero Bias Anomaly in the Anderson-Hubbard Model
• Bounds on the ground state energy of quantum $p$-spin Hamiltonians