Improved approximation algorithms for the EPR Hamiltonian
Quantum Physics
2025-04-16 v1 Data Structures and Algorithms
Abstract
The EPR Hamiltonian is a family of 2-local quantum Hamiltonians introduced by King (arXiv:2209.02589). We introduce a polynomial time -approximation algorithm for the problem of computing the ground energy of the EPR Hamiltonian, improving upon the previous state of the art of (arXiv:2410.15544). As a special case, this also implies a -approximation for Quantum Max Cut on bipartite instances, improving upon the approximation ratio of that one can infer in a relatively straightforward manner from the work of Lee and Parekh (arXiv:2401.03616).
Cite
@article{arxiv.2504.10712,
title = {Improved approximation algorithms for the EPR Hamiltonian},
author = {Nathan Ju and Ansh Nagda},
journal= {arXiv preprint arXiv:2504.10712},
year = {2025}
}