Thinking in qubits, using code
summary
Hands‑on Python demos use Qiskit emulator and state‑vector inspection to show concrete claims: a single Hadamard produces near 50/50 collapse (Hadamard -> ~50/50 (509/515) and 1055/993 for 2048 shots), Grover on two qubits reliably isolates target 11 after the oracle+diffusion sequence, and emulation exposes noise limits of actual hardware. Code and notebooks sit on GitHub, examples run thousands of shots, and the talk argues chaos‑engineering style resilience testing for noisy quantum backends.
AI-written summary · about
chapters (12)
- 0:00Introduction to quantum computing
- 3:37Classical vs quantum basics
- 9:23First demo: Hadamard gate
- 12:35Superposition explained
- 13:58Second demo: Quantum coin toss
- 16:50Entanglement and interference
- 18:59Grover’s algorithm overview
- 21:28Demo: Finding a PIN with Grover
- 25:21Quantum computing in cybersecurity
- 27:08Chaos engineering for quantum
- 27:53Key takeaways and resources
- 29:20Q&A session
