Unit 6 · Quantum Technology & Frontiers
Chapter23
Qubits & Quantum Computing
Computing with amplitudes instead of bits
Quantum Academy · presented by Dr. Quincy Quantenstein
CH 23X–Y
0:00 / 42:39OpeningTitle
Watch the lesson · Unit 6: Quantum Technology & Frontiers
Qubits & Quantum Computing
Computing with amplitudes instead of bits
- ≈ 43 min
- 65 scenes
- Narrated by Dr. Q
- Captions
Generated from the same script as the written lesson, so every word matches the text. Uses your device's voice when it has one; without one, the lesson plays silently with captions. Keys: Space play · ← → scenes · C captions · F full screen.
By the end you'll be able to
- Describe a qubit as a normalized pair of complex amplitudes and locate any single-qubit state on the Bloch sphere.
- Predict the action of the X, Z, Hadamard and CNOT gates and build the Bell state (1/√2)(|00⟩ + |11⟩) from |00⟩.
- Explain why n qubits need 2ⁿ amplitudes and why quantum algorithms work by choreographing interference rather than by trying every answer.
- Outline the idea behind the Deutsch–Jozsa algorithm, then Grover's search and Shor's factoring algorithm, and calculate how many rounds Grover's search requires.
- Compare superconducting, trapped-ion, neutral-atom, photonic and spin qubits and the role decoherence plays in each.
- Explain how error correction builds logical qubits and summarise, with dates, what quantum computers could and could not do as of 2026.