This is not entirely correct.
--
Also, from your linked article:
I will now introduce the Deutsch Oracle algorithm, one of the first examples of a quantum algorithm that is exponentially faster than its classical counterpart on the size of the input.
This is not entirely correct either.
--
See [1] for an authoritative source.
[1] https://www.nytimes.com/2011/12/06/science/scott-aaronson-qu...
Could you elaborate on why you believe my writings are imprecise? I read the link you provided, but couldn't find any divergence with its text though.
Here's the line of thought behind my statements if it's not clear to you:
1) Until a measure is made leading to the collapse of the quantum state qubits remain (possibly) in a superposed state. When a quantum gate is applied to these qubits it affects all superposed states (from a linear algebra point of view).
2) I took this statement from Wikipedia [1], forgot to link the source in the article: Simon, Daniel (November 1994). "On the Power of Quantum Computation". 94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science: 116–123.
[1] https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorith...