Lemma 8.4 ([1]}, [2]}) 
For all languages \({\cal L}= ({\cal L}_{\mathsf {yes}}, {\cal L}_{\mathsf {no}}) \in \textbf {QMA}\)  there exists a polynomial \(k(\lambda )\) , a function \(\ell (\lambda )\)  that is polynomial in the time \(T(\lambda )\)  required to verify instances of size \(\lambda \) , a QPT algorithm \(P_\mathsf {FHM}\) , and a PPT algorithm \(V_\mathsf {FHM}\)  such that the following holds.
