Introduction to Quantum Computing
summary
Claim: Shor’s algorithm can reduce factoring a 617-digit number in 100 seconds versus a classical billion years, but it requires ~1 million physical qubits while current devices have 50–70 physical qubits now and remain noisy. Demonstrations run small algorithms (Hadamard superposition, Grover on 4 items) on the IBM Q Experience demo and via Python APIs; results show nonzero error rates. Hardware approaches (superconductors, trapped ions, photons, diamonds) compete while research targets error reduction, hybrid quantum‑classical algorithms, and quantum simulations as the earliest useful application.
AI-written summary · about
chapters (21)
- 0:00Introduction
- 1:42Questions
- 5:26Exponential
- 6:31Applications
- 10:16Who is working on Quantum Computing
- 11:53Principles of Quantum Computing
- 12:39Superposition
- 14:58Entanglement
- 16:58Quantum Gates
- 20:11Measurement
- 21:46Running Quantum Algorithms
- 28:14Quantum Hardware
- 30:41Qbits
- 31:31Challenges
- 32:26Bike analogy
- 33:05Algorithms
- 33:50Timeline
- 36:45Summary
- 37:23Maths
- 39:33Key takeaways
- 41:04Two future states
related talks
28mThe future of computing with Quantum Computing
59mQuantum Computing Concepts
41mQuantum Computing Deep Dive
01h 01mQuantum Computing Concepts
55mQuantum computers and quantum programming
24mQuantum Computing: a Treasure Hunt, not a Gold Rush
42mA Supremely Light Introduction to Quantum Computing
01h 03mReal Quantum Computing