I recently came across a paper by Coudron and Yuen on randomness expansion using quantum devices. The main result of the work is that it is possible to generate "infinite" randomness from a constant number of sources (that is, the number of random bits generated depends only on the number of rounds of the protocol and not on the number of sources).
Naively, this sounds to me like the result allows derandomization of any randomized algorithm with quantum sources, and would imply some kind of containment of randomized complexity classes inside a corresponding quantum class.
But I don't really understand quantum information theory, and am sure there are many subtleties I'm missing. Not to mention that if such claims were possible, the authors would have made it. So my question is:
Does the existence of "infinite randomness expansion" as described in the paper (and all the related work) imply some kind of derandomization statements for randomized complexity classes ? And if not, why not ?
Update: I was pointed to this excellent high level overview of the area and of the above paper by Scott Aaronson. Unfortunately I'm still confused :).