Claude-reported proof of the QAOA ring conjecture
- Mathematics
- Theoretical Computer Science
For every depth p and even ring size N with 2p+2≤N, the optimal QAOA approximation ratio for MaxCut on the ring of disagrees is exactly (2p+1)/(2p+2).
Claude-reported proof of the QAOA ring conjecture
- Mathematics
- Theoretical Computer Science
For every depth p and even ring size N with 2p+2≤N, the optimal QAOA approximation ratio for MaxCut on the ring of disagrees is exactly (2p+1)/(2p+2).
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every depth p and even ring size N with 2p+2≤N, the optimal QAOA approximation ratio for MaxCut on the ring of disagrees is exactly (2p+1)/(2p+2).
Why it matters
If correct, supplies a separate machine-verified, AI-generated constructive proof of the exact depth-p QAOA performance on this benchmark.
What counts as progress
For an even cycle of size $N$ and depth $p$ with $2p + 2 \le N$, is the optimal QAOA approximation ratio for MaxCut exactly $\frac{2p+1}{2p+2}$, as Farhi, Goldstone and Gutmann conjectured?
Website timeline
Publication dates and editorial changes.