Performance of Variational Algorithms for Local Hamiltonian Problems on Random Regular Graphs
Kunal Marwaha, Adrian She, James Sud

TL;DR
This paper introduces two variational algorithms inspired by QAOA for optimizing local Hamiltonians on random regular graphs, analyzing their performance and limitations, and comparing them to classical and worst-case algorithms.
Contribution
The paper develops formulae to analyze variational algorithms' energy performance on large random regular graphs and compares their effectiveness to classical and worst-case methods.
Findings
Algorithms outperform classical methods on EPR and bipartite QMC Hamiltonians.
Symmetry in the algorithms hinders optimization of the general QMC Hamiltonian.
Five layers suffice to approximate the ground state within 1.62% error for QMC on a 1D ring.
Abstract
We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these algorithms with high probability over random regular graphs in the infinite-size limit, using techniques from [arXiv:2110.14206]. The complexity of evaluating these formulae scales exponentially with the number of layers of the algorithms, so our numerical evaluation is limited to a small constant number of layers. We compare these algorithms to simple classical approaches and a state-of-the-art worst-case algorithm. We find that the symmetry inherent to these specific variational algorithms presents a major \emph{obstacle} to successfully optimizing the Quantum MaxCut (QMC) Hamiltonian on general graphs. Nonetheless, the algorithms outperform known…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Graph Theory and Algorithms
