Improved approximation algorithms for the EPR Hamiltonian
Abstract
The EPR Hamiltonian is a family of 2-local quantum Hamiltonians introduced by King (arXiv:2209.02589). We introduce a polynomial time 1+54≈ 0.809-approximation algorithm for the problem of computing the ground energy of the EPR Hamiltonian, improving upon the previous state of the art of 0.72 (arXiv:2410.15544). As a special case, this also implies a 1+54-approximation for Quantum Max Cut on bipartite instances, improving upon the approximation ratio of 3/4 that one can infer in a relatively straightforward manner from the work of Lee and Parekh (arXiv:2401.03616).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.