Quantum Computing Deep Dive
summary
Explains why quantum speedups matter, shows hands-on circuits run on IBM Q Experience (mostly 5–15 qubits, noisy) and simulated in Microsoft Q#, and demonstrates entanglement, teleportation code and the Deutsch/Grover/Shor algorithms. Claims exponential state growth (each added qubit doubles state size), cites the 42-fold paper-folding illustration, and notes hardware limits: algorithms work in simulation and on tiny real devices today but require many more stable qubits to break real encryption.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 2:20Session goals
- 4:08Why quantum matters
- 5:25Exponential growth example
- 7:10Quantum mechanics overview
- 8:20The double slit experiment
- 12:47Electron experiment
- 16:59Superposition and entanglement
- 20:38Real-world applications
- 23:20Quantum vs classical computers
- 26:33Qubits and Dirac notation
- 28:56Mathematical representation
- 33:35Scaling and power
- 36:48Quantum gates
- 40:05IBM Q experience
- 45:05Microsoft Q#
- 50:25Entanglement in code
- 52:41Mathematical proof of entanglement
- 55:06Teleportation
- 56:53Quantum algorithms and conclusion
related talks
41mQuantum Computing deep dive
59mDiving Into Q#
41mState of Quantum Computing in programming
01h 01mEmpowering the Quantum revolution with Q#
26mA sneak peek into the future with quantum computing
57mGod really plays dice - Introduction to Quantum Computing with Q#
24mQuantum meets AI: Unlocking Tomorrow’s Potentials
59mThe Bizarre Quantum World with Q# and Azure Quantum