Improved approximation algorithms for the EPR Hamiltonian

DOI10.4230/LIPICS.APPROX/RANDOM.2025.24MaRDI QIDQ7346852zbMATH OpenFDO

Authors Nathan Ju

Publication date 11 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2025.24

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A polynomial algorithm for b-matchings: An alternative approach
• An improved quantum max cut approximation via maximum matching
• Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms
• Approximation algorithms for QMA-complete problems
• Approximation algorithms for quantum many-body problems
• scientific article; zbMATH DE number 3002434 (Why is no real title available?)
• scientific article; zbMATH DE number 7650098 (Why is no real title available?)
• Matching theory
• Maximum matching and a polyhedron with 0,1-vertices
• Partition function of the eight-vertex lattice model
• Product-state approximations to quantum states
• Two soluble models of an antiferromagnetic chain
• Unique games hardness of quantum max-cut, and a conjectured vector-valued Borell's inequality

This page was built for publication: Improved approximation algorithms for the EPR Hamiltonian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346852)