An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms

06/16/2022
by   Ojas Parekh, et al.
0

We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programming relaxation, is known for QMC, paralleling the celebrated 0.878-approximation for classical Max Cut. For Max Cut, improving the 0.878-approximation is Unique-Games-hard (UG-hard), and one might expect that improving the 0.498-approximation is UG-hard for QMC. In contrast, we give a classical 1/2-approximation for QMC that is unconditionally optimal, since simple examples exhibit a gap of 1/2 between the energies of an optimal product state and general quantum state. Our result relies on a new nonlinear monogamy of entanglement inequality on a triangle that is derived from the second level of the quantum Lasserre hierarchy. This inequality also applies to the quantum Heisenberg model, and our results generalize to instances of Max 2-Local Hamiltonian where each term is positive and has no 1-local parts. Finally, we give further evidence that product states are essential for approximations of 2-Local Hamiltonian.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2021

Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality

The Gaussian noise stability of a function f:ℝ^n →{-1, 1} is the expecte...
research
09/19/2019

Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut

Approximation algorithms for constraint satisfaction problems (CSPs) are...
research
06/06/2023

Sphere Valued Noise Stability and Quantum MAX-CUT Hardness

We prove a vector-valued inequality for the Gaussian noise stability (i....
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...
research
05/12/2021

Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms

The Lasserre Hierarchy is a set of semidefinite programs which yield inc...
research
09/06/2022

Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations

We prove concentration bounds for the following classes of quantum state...
research
11/24/2021

A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT

We give a simple classical algorithm which provably achieves the perform...

Please sign up or login with your details

Forgot password? Click here to reset