Huh? Assuming I understand your comment correctly, that is, not what that paper is showing. That paper is showing that if the verifier has polynomial time comp

Huh? Assuming I understand your comment correctly, that is, not what that paper is showing. That paper is showing that if the verifier has polynomial time computational power, with two provers who each have unlimited computational power, and who have some shared quantum entanglement, are communicating individually with the prover, and the prover also has access to randomness and such, then there is a protocol that can allow the provers to, for any recursively enumerable language, demonstrate to the verifier, for any string, whether that string is in that language. RE is a WAY bigger class than what the verifier can compute alone. And, is also way bigger than the without-entanglement version, MIP. That paper is showing that adding quantum entanglement to the setup for MIP, allows for way more problems to be in the class.