Thanks for this clear explanation of the issue! This looks to me like a convincing rebuttal of the specific claim Google made about classical runtime at this pa

Thanks for this clear explanation of the issue! This looks to me like a convincing rebuttal of the specific claim Google made about classical runtime at this particular size, but does it rule out Google claiming supremacy by using the problem constrained such that n == m? Or would Google's device have exponential runtime growth in that variant?