Quantum computing
summary
Explains why some problems explode exponentially — simulating caffeine needs about 10^48 bits (roughly 1–10% of Earth’s mass if using one bit per atom) — and shows quantum algorithms that genuinely reduce complexity: Grover's algorithm cuts search from O(n) to O(√n) (demo finds a hidden card among four in one attempt). Uses real cloud-accessible hardware via IBM Q and Qiskit from Jupyter; runs on ~14 qubits show measurable noise. Predicts useful quantum advantage for chemistry/optimization near 100–1,000 qubits within ~5 years, while breaking cryptography needs ~10^8 qubits and a decade-plus of engineering.
AI-written summary · about
chapters (4)
- 0:00Start
- 6:11The best supercomputer in the world can accurately simulate a 40-50 electron system.
- 37:41materials design
- 38:01artificial intelligence classification machine learning linear algebra
