Optimizing sparse fermionic Hamiltonians

11/29/2022
by   Yaroslav Herasymenko, et al.
0

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 (Hastings O'Donnell, 2022), we prove that strictly q-local sparse 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 q-local means that each term involves exactly q 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 4-local interactions (sparse SYK-4 model). In each setting we show that the Gaussian state can be efficiently determined. Finally, we prove that the O(n^-1/2) Gaussian approximation ratio for the normal (dense) SYK-4 model extends to SYK-q for even q>4, with an approximation ratio of O(n^1/2 - q/4). Our results identify non-sparseness as the prime reason that the SYK-4 model can fail to have a constant approximation ratio.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2019

Krivine diffusions attain the Goemans--Williamson approximation ratio

Answering a question of Abbasi-Zadeh, Bansal, Guruganesh, Nikolov, Schwa...
research
02/28/2021

On the Approximation Ratio of the 3-Opt Algorithm for the (1,2)-TSP

The (1,2)-TSP is a special case of the TSP where each edge has cost eith...
research
08/29/2023

Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios

The quantum alternating operator ansatz (QAOA) is a heuristic hybrid qua...
research
02/09/2022

Constant Approximating Parameterized k-SetCover is W[2]-hard

In this paper, we prove that it is W[2]-hard to approximate k-SetCover w...
research
02/22/2019

ℓ_1-sparsity Approximation Bounds for Packing Integer Programs

We consider approximation algorithms for packing integer programs (PIPs)...
research
05/03/2021

Improved approximation algorithms for bounded-degree local Hamiltonians

We consider the task of approximating the ground state energy of two-loc...

Please sign up or login with your details

Forgot password? Click here to reset