Can I Learn Quantum Computing Without Using So Much Math?
You don't need to be a mathematician to understand quantum computing, but when things become tricky, math is your ally.
In classical computing, we are used to thinking in boolean states. A term is true or false. A bit is off (0) or on (1). That’s it. It is the basis for all our algorithms.
With boolean logic and with only very few operators, such as not, and, and or, we can develop quite complex programs. If a term is true, do this, else do that. For this term is true, repeat doing a certain thing.
As a programmer, you likely have truth tables in your mind all day.
In quantum computing, our bit is the qubit (short for a quantum bit). It is not 0 or 1 but in a complex (as in complex numbers) linear combination of 0 and 1.
Let’s say we have a coin. When you put the coin at the table, you have a classical bit. It is either heads-up or tails-up. You can define your logic in boolean terms. You specify what happens if the coin is heads-up or what you do while it is tails-up. And, of course, you can work with the coin. You can put it on the table in any direction you like. Your instructions look like this: “If the coin is heads-up, then take it and put it on the table tails-up.”
In quantum computing, we toss the coin. It rotates in the air. It is in a combination of heads and tails. If and only if you catch it and look at it, it decides for a value. Once landed, it is a normal coin with heads-up or tails-up.