In the definition of the class $\mathcal{BQP}$ found in textbooks we (as the circuit builders) have access to an unlimited number of deterministic zero-initialized qubits and to a finite set of quantum gets (it turns out that some sets of gates are universal). I'm struggling to make the definition of $\mathcal{BQP}$ intuitive for me and to figure out which parts are essential. What would happen if we were to only allow the Toffoli gate (which is universal for classical computation) and an unlimited number of qubits, each with a state chosen from a finite set? The question arises, are some sets of qubits universal, that is no other set induces a bigger complexity class? If so, what is this maximal complexity class?
When going from deterministic to randomized computation it is enough to have random bits and no random gates, and $\mathcal{NP}$ could I think also be defined in terms of "nondeterministic" bits, so that makes me wonder if the same can be done for quantum computation (and if, as I expect, not, then why not).