Provable Classical and Quantum Local Algorithms for Max- k-Cut and Quantum Advantage at Moderate Girth
quant-ph, cs.DS, math.OC
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree
- Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
- Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
- A Quantum Approximate Optimization Algorithm
- Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
- A proof of Alon's second eigenvalue conjecture and related problems
- A Classical Algorithm Which Also Beats $\frac{1}{2}+\frac{2}{\pi}\frac{1}{\sqrt{D}}$ For High Girth MAX-CUT
- Large Cuts with Local Algorithms on Triangle-Free Graphs
- Optimization of the Sherrington-Kirkpatrick Hamiltonian
- Optimization on Sparse Random Hypergraphs and Spin Glasses
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity