Quantum computing part 2

Now that you guys have a basic understanding info regular computing and how the binary system works, I'm going to go a little more in depth on a topic of quantum physics that could change the computing world forever.

Remember when I said that binary works as to different choices: 1 or 2? What if there were more than two choices? For example, what if the computer could display back a 1.5?  Well, in quantum computing this may be possible. In order for us to understand this, however, we have to look at an electron. Every electron has its own magnetic field that it spins towards. This works the same way as a compass as it points in the direction of the Earth's magnetic field.  Whenever and electron is pointing towards the field, it is known as "spin down".  You can also make the electron point in the opposite direction of the field, but this requires a little bit of force.  This is known as "spin up". What makes quantum computing different from basic computing is that these electrons, known as qubits, can be both spin up and sin down at the same time. Wow this may seem confusing, the idea relates back to the superposition, theory where we can not measure the exact position of the electron.  So, you may be wondering how this increases computer power. The reason is that it allows us to use a coefficient rather than two specific numbers.

If we take two bits of basic codes, you can get for different combinations: 00, 01, 10, or 11. However if you use quantum bits, you will get "up, down", "down, up", "down, down", and "up, up". So they both give you four different combinations. When it comes to quantum computing, you can have a coefficient that represents how relative the spin is down, and how relative it is up. This equations can be represent by the formula 2^n, where n is the number of qubits. So in the end you allow for much more processing power.