We beat Google’s zero-knowledge proof of quantum cryptanalysis

Really cool work from ToB. To clarify, the resource estimates they show are from them exploiting the verifier, not designing a better circuit—a good sanity check is the 0 Toffoli (or non-Clifford) gates, that would imply the circuit could be simulated efficiently classically.