Trippy. Okay so if a standard app was "made" to run on a Quantum Computer, then it would like thousands of times faster?

Its not so trippy when you know logic of quantum mechanics and logic of boolean algebra are in essence competely different.

If you have proposition A and proposition B in boolean algebra you can do some operation with them by use of truth functions, ie: "A and B", "A or B", "A xor B", "not A", "not B" and so on. As a result you will get valid logical state. In other words result of operation that works on your proposition is either true or false.

Proposition A: 8 > 5

Proposition B: 7 = 3 +4

A is true, B is also true, so result of operation "A and B" is true. If for B I said "7 = 1 + 4", the result of "A and B" would be false. In a more abstract way its very similar with classical physics. Another thing is reverse must also be true, so "A and B" should always evaluate to the same result as "B and A".

In quantum mechanics these logical operations have no meaning, because it boils down to probability. For example, given that spin of electron can be in either -1 or +1, and suppose in the start of measurement the spin is aligned with x-component and gives +1, you can say:

Proposition A: x-component of spin of an electron is +1.

Proposition B: y-component of spin of an electron is +1.

Lets try "A and B":

*After measuring x-component you get +1, then when you measure y-component you get 50% chance to get +1.*
Now try reverse condition, ie "B and A", and it should render the same result, but it doesn't:

*After measuring y-component you get 50% to get +1, and after that when you measure x-component you get 25% to get +1.*
In other words in quantum mechanics "A and B" is not "B and A". Many of boolean logic simply does not hold for quantum mechanics.

So my conclusion is that if the application is made specifically to work with quantum computer it might not work at all with classical PC, and reverse.