Quantum computing and encoding trees

I suppose I should be able to relate the two, and I am a novice here, so I take a blundering guess.

First, what we are is mostly a 5-8 qubit tree, the rank of our system while quantum computing starts with 100 qubits, way larger.
The second related point is that we rebuild the quantum network each round of the pit boss intervention, we program by redesigning the entire quantum computer to solve the one problem.

QM has superposition, I think I call that the commutative property, because we are selecting one at  time, a simulation perhaps. Consider a sandbox trading pit in which any of the trading bot cold bid at the same time, no round robin access to the structured queues. That needs a real quantum computer.  But with our high market uncertainty, the round robin wait interval is trivial.

So far it looks to me we make a very simple qubit simulator, but then, I am still working on details like the relationship between the ancilla bit in the accumulated bit error. We are simple because we carry lots of ancilla bits, round off error is a good metaphor.  Ancillla bits make the whole process much simpler.

This is work in progress, ans I progress sporadically, it comes in surges.