🚀 Module 5 · Lesson 2/2

🖥️Quantum Computers & the Future

Qubits, gates and the second quantum revolution.

⏱️ 18 minStart

🎯 By the end you will…

  • ✓Compare a bit with a qubit
  • ✓Apply X and H gates on a qubit
  • ✓Separate hype from reality

A normal computer bit is 0 or 1. A qubit can be in a superposition of 0 and 1 — any point on the Bloch sphere. Quantum computers manipulate qubits with gates (rotations of that arrow), let their possibilities interfere, and then measure.

The trick is not “trying every answer at once”. It's choreographing interference so wrong answers cancel out and right answers reinforce — like the bright and dark stripes of the double-slit.

🎛️Interactive experiment

Apply gates to the qubit. X flips it (like NOT). H puts |0⟩ into an equal superposition. Z flips its phase — invisible to measurement alone, but vital for interference. Try H, then H again!

🧮Equation, decoded

Why qubits scale so fast

What each symbol means

  • The number of qubits
  • 2 multiplied by itself n times

📖 Say it like a story

Describing 1 qubit takes 2 amplitudes, 2 qubits take 4, 10 take 1,024… and 300 qubits would need more numbers than there are atoms in the visible universe. That's why ordinary computers struggle to simulate quantum systems — and why Feynman suggested building computers out of quantum parts.

✅ Check your understanding

Answer all questions to complete the lesson and earn XP.

  1. 1. How is a qubit different from a bit?

  2. 2. What does applying H twice to |0⟩ give?

  3. 3. How many amplitudes describe 3 qubits?

📚 Sources & further reading