Quantum Computing Deep Dive
summary
Claims a working demo pipeline: live circuits run on IBM Q Experience (a five qubit machine with queued real runs) and local emulation with Microsoft Q#. Shows Hadamard and CNOT building entangled pairs, measures 50/50 superposition, and explains Grover’s √n speedup, Deutsch/Deutsch‑Jozsa deterministic advantage, and Shor factoring small integers (143 then 56153) — algorithms compile and simulate; hardware runs succeed but are limited by decoherence and queue latency.
AI-written summary · about
chapters (21)
- 0:00Introduction
- 1:16Why am I presenting this talk
- 2:37Agenda
- 3:15Why Quantum Computing
- 4:12Time Complexity
- 5:26Chess Legend
- 7:47Artificial Intelligence
- 8:28Drug Development
- 9:07Crysis
- 9:47Quantum Physics
- 10:18Superposition
- 11:56Entangling
- 13:56Quantum Superposition
- 16:01Quantum Operations
- 24:04Hadamard
- 24:40C gate
- 25:12Measurement
- 26:01IBM Q Experience
- 29:10Entanglement
- 31:58Microsoft Qsharp
- 37:03Quantum Computing Algorithms
related talks
01h 03mReal Quantum Computing
51mA Beginner's Guide To Programming Quantum Computers With Open-...
42mA Supremely Light Introduction to Quantum Computing
42mIntroduction to Quantum Computing
55mQuantum computers and quantum programming
48mGetting Started with Quantum Programming
01h 01mQuantum Computing Concepts
28mThe future of computing with Quantum Computing