Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Optimization

A 0.8395-approximation algorithm for the EPR problem

arXiv

Authors: Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, Lennart Sinjorgo, James Sud

Year

2025

Paper ID

15884

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

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.

Why This Paper Matters

This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
It adds a 2025 reference point for readers tracking recent quantum research.
We give an efficient 0.8395-approximation algorithm for the EPR Hamiltonian.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2512.09896 [2] arXiv https://arxiv.org/abs/2512.09896 [3] Publisher https://arxiv.org/abs/2512.09896

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.