Optimizing sparse fermionic Hamiltonians
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara Terhal

TL;DR
This paper demonstrates that sparse fermionic Hamiltonians, including certain models like the sparse SYK-4, can be efficiently approximated by Gaussian states with a constant ratio, unlike dense models.
Contribution
The paper proves that sparse fermionic Hamiltonians have a constant Gaussian approximation ratio, extending to models with quadratic and quartic terms, and clarifies why dense models like SYK-4 differ.
Findings
Sparse fermionic Hamiltonians admit constant Gaussian approximation ratios.
Efficient determination of Gaussian states for sparse Hamiltonians.
Extension of approximation ratios to SYK-q models with even q.
Abstract
We consider the problem of approximating the ground state energy of a fermionic Hamiltonian using a Gaussian state. In sharp contrast to the dense case, we prove that strictly -local fermionic Hamiltonians have a constant Gaussian approximation ratio; the result holds for any connectivity and interaction strengths. Sparsity means that each fermion participates in a bounded number of interactions, and strictly -local means that each term involves exactly fermionic (Majorana) operators. We extend our proof to give a constant Gaussian approximation ratio for sparse fermionic Hamiltonians with both quartic and quadratic terms. With additional work, we also prove a constant Gaussian approximation ratio for the so-called sparse SYK model with strictly -local interactions (sparse SYK- model). In each setting we show that the Gaussian state can be…
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.
Taxonomy
TopicsQuantum many-body systems · Cold Atom Physics and Bose-Einstein Condensates · Quantum Computing Algorithms and Architecture
