However, in order for there to be any hope of this idea working, it must be the case that measurement protocols for bases with succinct representations are still useful for constructing delegation for BQP. Fortunately, it has been shown [1]} that classically verifiable (non-succinct) arguments for BQP can be constructed by invoking Mahadev's measurement protocol (and, by inspection of the proof, any measurement protocol satisfying our definition) on a uniformly random basis string \(h \leftarrow \lbrace 0,1\rbrace ^N\) . Then, by computational indistinguishability, it is also possible to use a pseudorandom string \(h\)  that has a succinct representation, i.e., \(h = (\mathsf {PRF}_s(1), \hdots , \mathsf {PRF}_s(N))\)  for some (post-quantum) pseudorandom function \(\mathsf {PRF}\) .
