Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
By: Anuj Apte, Ojas Parekh, James Sud
Potential Business Impact:
Finds better ways to solve hard math problems.
We explain how the maximum energy of the Quantum MaxCut, XY, and EPR Hamiltonians on a graph $G$ are related to the spectral radii of the token graphs of $G$. From numerical study, we conjecture new bounds for these spectral radii based on properties of $G$. We show how these conjectures tighten the analysis of existing algorithms, implying state-of-the-art approximation ratios for all three Hamiltonians. Our conjectures also provide simple combinatorial bounds on the ground state energy of the antiferromagnetic Heisenberg model, which we prove for bipartite graphs.
Similar Papers
Improved approximation algorithms for the EPR Hamiltonian
Quantum Physics
Finds best energy for quantum computers.
A 0.8395-approximation algorithm for the EPR problem
Quantum Physics
Finds better ways to use quantum computers.
A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
Quantum Physics
Finds best ways to make quantum computers work.