REVIEW 3 cited by
Improved approximation algorithms for the EPR Hamiltonian
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The EPR Hamiltonian is a family of 2-local quantum Hamiltonians introduced by King (arXiv:2209.02589). We introduce a polynomial time $\frac{1+\sqrt{5}}{4}\approx 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 $\frac{1+\sqrt{5}}{4}$-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).
Forward citations
Cited by 3 Pith papers
-
Efficient quantum algorithm for Heisenberg spin systems
The spectral gap of any Suzuki-Fisher Heisenberg Hamiltonian is at least twice the minimum Z-field, yielding a polynomial-time quantum adiabatic algorithm for the ground energy of such systems and of bipartite Quantum MaxCut.
-
A Refined Algorithm For the EPR model
A refined algorithm for the EPR model using homogeneous and quasi-homogeneous fractional matchings achieves improved approximation ratios on regular graphs, e.g., 0.872 for 2-regular graphs.
-
Testing APS conjecture on regular graphs
The FED algorithm's energy estimates on Henning-Yeo regular graphs never exceed the APS conjecture's predicted bound, so the tests find no violation.
Discussion (0). Continue with ORCID to comment.