Document Open Access Logo

Improved Approximation Algorithms for the EPR Hamiltonian

Authors Nathan Ju , Ansh Nagda

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2025.24.pdf
  • Filesize: 0.71 MB
  • 9 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
Keywords
  • Approximation Algorithms
  • Quantum Local Hamiltonian

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The EPR Hamiltonian is a family of 2-local quantum Hamiltonians introduced by King [King, 2023]. We introduce a polynomial time (1+√5)/4≈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 [Jorquera et al., 2024].

Cite As Get BibTex

Nathan Ju and Ansh Nagda. Improved Approximation Algorithms for the EPR Hamiltonian. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 353, pp. 24:1-24:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.24

Author Details

Nathan Ju
  • UC Berkeley, CA, USA
Ansh Nagda
  • UC Berkeley, CA, USA

Supplementary Materials

References

  1. Anurag Anshu, David Gosset, and Karen Morenz. Beyond product state approximations for a quantum analogue of max cut. arXiv preprint, 2020. URL: https://arxiv.org/abs/2003.14394.
  2. Richard P Anstee. A polynomial algorithm for b-matchings: an alternative approach. Information Processing Letters, 24(3):153-157, 1987. URL: https://doi.org/10.1016/0020-0190(87)90178-5.
  3. Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, and James Sud. Improved algorithms for quantum maxcut via partially entangled matchings. arXiv preprint, 2025. URL: https://arxiv.org/abs/2504.15276.
  4. Nikhil Bansal, Sergey Bravyi, and Barbara M Terhal. Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. arXiv preprint, 2007. URL: https://arxiv.org/abs/0705.1115.
  5. Rodney J Baxter. Partition function of the eight-vertex lattice model. Annals of Physics, 70(1):193-228, 1972. Google Scholar
  6. Thiago Bergamaschi. Improved product-state approximation algorithms for quantum local hamiltonians. arXiv preprint, 2022. URL: https://arxiv.org/abs/2210.08680.
  7. Hans Bethe. Zur theorie der metalle: I. eigenwerte und eigenfunktionen der linearen atomkette. Zeitschrift für Physik, 71(3):205-226, 1931. Google Scholar
  8. Fernando GSL Brandao and Aram W Harrow. Product-state approximations to quantum states. Communications in Mathematical Physics, 342:47-80, 2016. Google Scholar
  9. Sergey Bravyi, David Gosset, Robert König, and Kristan Temme. Approximation algorithms for quantum many-body problems. Journal of Mathematical Physics, 60(3), 2019. Google Scholar
  10. Jack Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B, 69(125-130):55-56, 1965. Google Scholar
  11. Sevag Gharibian and Julia Kempe. Approximation algorithms for qma-complete problems. SIAM Journal on Computing, 41(4):1028-1050, 2012. URL: https://doi.org/10.1137/110842272.
  12. Sevag Gharibian and Ojas Parekh. Almost optimal classical approximation algorithms for a quantum generalization of max-cut. arXiv preprint, 2019. URL: https://arxiv.org/abs/1909.08846.
  13. Sander Gribling, Lennart Sinjorgo, and Renata Sotirov. Improved approximation ratios for the quantum max-cut problem on general, triangle-free and bipartite graphs. arXiv preprint, 2025. URL: https://arxiv.org/abs/2504.11120.
  14. Aram W Harrow and Ashley Montanaro. Extremal eigenvalues of local hamiltonians. Quantum, 1:6, 2017. URL: https://doi.org/10.22331/Q-2017-04-25-6.
  15. Felix Huber, Kevin Thompson, Ojas Parekh, and Sevag Gharibian. Second order cone relaxations for quantum max cut, 2024. URL: https://arxiv.org/abs/2411.04120.
  16. Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, and John Wright. Unique games hardness of quantum max-cut, and a conjectured vector-valued borell’s inequality. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1319-1384. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH48.
  17. Zackary Jorquera, Alexandra Kolla, Steven Kordonowy, Juspreet Singh Sandhu, and Stuart Wayland. Monogamy of entanglement bounds and improved approximation algorithms for qudit hamiltonians. arXiv preprint, 2024. URL: https://arxiv.org/abs/2410.15544.
  18. Robbie King. An improved approximation algorithm for quantum max-cut on triangle-free graphs. Quantum, 7:1180, 2023. URL: https://doi.org/10.22331/Q-2023-11-09-1180.
  19. Eunou Lee. Optimizing quantum circuit parameters via sdp, 2022. URL: https://arxiv.org/abs/2209.00789.
  20. Eunou Lee and Ojas Parekh. An Improved Quantum Max Cut Approximation via Maximum Matching. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), volume 297 of Leibniz International Proceedings in Informatics (LIPIcs), pages 105:1-105:11, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.105.
  21. Elliott Lieb, Theodore Schultz, and Daniel Mattis. Two soluble models of an antiferromagnetic chain. Annals of Physics, 16(3):407-466, 1961. Google Scholar
  22. László Lovász and Michael D Plummer. Matching theory, volume 367. American Mathematical Soc., 2009. Google Scholar
  23. Ojas Parekh and Kevin Thompson. Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pages 102:1-102:20, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.102.
  24. Ojas Parekh and Kevin Thompson. An optimal product-state approximation for 2-local quantum hamiltonians with positive terms. arXiv preprint, 2022. URL: https://doi.org/10.48550/arXiv.2206.08342.
  25. Anders W Sandvik. Computational studies of quantum spin systems. In AIP Conference Proceedings, volume 1297, pages 135-338. American Institute of Physics, 2010. Google Scholar
  26. Jun Takahashi, Chaithanya Rayudu, Cunlu Zhou, Robbie King, Kevin Thompson, and Ojas Parekh. An SU(2)-symmetric semidefinite programming hierarchy for quantum max cut, 2023. URL: https://arxiv.org/abs/2307.15688.
  27. Jun Takahashi, Sam Slezak, and Elizabeth Crosson. Rapidly mixing loop representation quantum monte carlo for heisenberg models on star-like bipartite graphs, 2024. URL: https://doi.org/10.48550/arXiv.2411.01452.
  28. Adam Bene Watts, Anirban Chowdhury, Aidan Epperly, J. William Helton, and Igor Klep. Relaxations and exact solutions to quantum max cut via the algebraic structure of swap operators. Quantum, 8:1352, May 2024. URL: https://doi.org/10.22331/Q-2024-05-22-1352.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact