Consider n qubits on a square grid, with n3 layers cycling through the four horizontal/vertical even/odd matchings and independent Haar-random two-qubit gates. Prove that a polynomial-time classical sampler within total-variation distance 1/n of the ideal output on at least a 1−1/n fraction of these circuits would collapse the polynomial hierarchy, using only standard worst-case complexity assumptions.