A 0.8395-approximation algorithm for the EPR problem

2025/12/10 by Eunou Lee, Apte, Anuj, Lee, Eunou +8 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications

paper · pdf · doi:10.48550/arxiv.2512.09896

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.

Citations

• A Refined Algorithm For the EPR model
• Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
• Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
• Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
• Improved approximation algorithms for the EPR Hamiltonian
• Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
• An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
• An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
• Merlin-Arthur Games and Stoquastic Complexity
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Cited by

• Spectral gap of Lee-Yang Hamiltonians

Related

• Improved approximation algorithms for the EPR Hamiltonian
• A Refined Algorithm For the EPR model
• Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
• Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
• A doubly exponential upper bound on noisy EPR states for binary games