Is it possible to make a quantum computer from a perfect random number generator. I'm wondering if anybody that's studied it could make one from that type of random number generator.
No. Quantum computation is, for all what we (this is, most people working on quantum computing) know/beleive, strictly stronger than randomized classical computation. There is, however, no proof for that -- just as for most statements of that kind (and comparable strength) in computational complexity.
The relevant complexity classes are called BPP (classical randomized) and BQP (quantum computing), so you might want to search for what is known about equality vs. strict containment of BPP in BQP. Some information can be found, e.g., in the complexity zoo: https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bqp , where it is stated that relative to an oracle, BPP is not equal BQP.