QAOA on the infinite SK model maps exactly to a spin-boson Hamiltonian whose ground-state energy can be computed with matrix-product states, yielding numerical evidence that depth O(n/ε^1.13) suffices for (1-ε) approximation in the average case.
Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Presents the first iterative spectral algorithm for near-optimal solutions to random quadratic optimization over the hypercube, resolving Subag's conjecture via potential Hessian ascent and SDE approximation.
citing papers explorer
-
Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm
QAOA on the infinite SK model maps exactly to a spin-boson Hamiltonian whose ground-state energy can be computed with matrix-product states, yielding numerical evidence that depth O(n/ε^1.13) suffices for (1-ε) approximation in the average case.
-
Potential Hessian Ascent: The Sherrington-Kirkpatrick Model
Presents the first iterative spectral algorithm for near-optimal solutions to random quadratic optimization over the hypercube, resolving Subag's conjecture via potential Hessian ascent and SDE approximation.