| $< 1$ | [P25] | There exists $\alpha<1$, such that it is NP-hard to compute a value approximating QMC to within approximation ratio $\alpha$. |value changed 2026-09-05
Lower bound, last-listed row
| 0.614 | [BBKL26] | Proves monogamy conjecture from [ALMPS25]tracked since 2026-07-24 — no movement seen yet
Cite this rowBounds Ledger — Approximation ratio for quantum Max Cut. (50a)
upper bound: $< 1$ (value changed 2026-09-05)
lower bound: 0.614 (tracked since 2026-07-24 — no movement seen yet)
Mirrored from teorth/optimizationproblems@2c1968c. These are the last-listed rows of that constant's bounds table — a listing position, not a statement that this bound is the strongest or most recent. A snapshot at that sha, not a live read.
https://u00dxk2.github.io/bounds-ledger/c/50a.html