For every \eta>0 there are an integer p\ge1, deterministic normalized angles \gamma,\beta\in\R^p, and an integer D_0\ge2 such that, for every integer D\ge D_0 and every finite simple unweighted (D+1)-regular graph G of girth greater than 2p+1,
q_{p,G}(2\gamma/\sqrt D,\beta)
\ge \frac12+\frac{\Pstar-\eta}{\sqrt D}.
The word p,\gamma,\beta is independent of D, the graph size, and G; the displayed usual MaxCut cost angles, unlike the normalized angles \gamma, are scaled with the degree.
Let G_{n,d} be uniform among simple labelled d-regular graphs on n vertices, along admissible n with nd even. For the same word, put
\Delta_D(G)=\operatorname{OPT}(G)
-q_{p,G}(2\gamma/\sqrt D,\beta).
The word may be chosen so that
\begin{gathered}\lim_{D\to\infty}
\limsup_{\substack{n\to\infty\\ n(D+1)\ \mathrm{even}}}
\Pr_G\!\left[\sqrt D\,\Delta_D(G_{n,D+1})>\eta\right]=0.\end{gathered}
Here the inner limit keeps D,p,\gamma,\beta fixed, and \Pr_G is only over the graph: q_{p,G} already averages quantum measurement.
No Lean statement in the release is paired with this theorem.