A 0.8395-approximation algorithm for the EPR problem
Quantum Physics
2025-12-11 v1 Data Structures and Algorithms
Abstract
We give an efficient 0.8395-approximation algorithm for the EPR Hamiltonian. Our improvement comes from a new nonlinear monogamy-of-entanglement bound on star graphs and a refined parameterization of a shallow quantum circuit from previous works. We also prove limitations showing that current methods cannot achieve substantially better approximation ratios, indicating that further progress will require fundamentally new techniques.
Keywords
Cite
@article{arxiv.2512.09896,
title = {A 0.8395-approximation algorithm for the EPR problem},
author = {Anuj Apte and Eunou Lee and Kunal Marwaha and Ojas Parekh and Lennart Sinjorgo and James Sud},
journal= {arXiv preprint arXiv:2512.09896},
year = {2025}
}
Comments
27 pages