{"ID":2830838,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.09896","arxiv_id":"2512.09896","title":"A 0.8395-approximation algorithm for the EPR problem","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.","short_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 sub...","url_abs":"https://arxiv.org/abs/2512.09896","url_pdf":"https://arxiv.org/pdf/2512.09896v1","authors":"[\"Anuj Apte\",\"Eunou Lee\",\"Kunal Marwaha\",\"Ojas Parekh\",\"Lennart Sinjorgo\",\"James Sud\"]","published":"2025-12-10T18:25:31Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"cs.DS\"]","methods":"[]","has_code":false}