A 0.8395-approximation algorithm for the EPR problem
By: Anuj Apte , Eunou Lee , Kunal Marwaha and more
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.
Similar Papers
Improved approximation algorithms for the EPR Hamiltonian
Quantum Physics
Finds best energy for quantum computers.
Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs
Emerging Technologies
Solves hard puzzles faster using a new computer trick.
Distribution and Purification of Entanglement States in Quantum Networks
Quantum Physics
Makes quantum internet connections super strong.