Quantum Computing Concepts
summary
Claims that quantum machines can beat classical for specific problems, not universally, and that molecular simulation will arrive long before RSA breaking; Microsoft shows concrete progress: Q# open source with simulators that run roughly 30 qubit local simulation, a cloud coprocessor model, and resource estimation tooling that cuts a chemistry problem from 10^17 to ~10^10 resources and further to a day‑and‑a‑half runtime after optimization. Hardware approach targets Majorana‑based qubits in millikelvin fridges to reduce error rates; demo uses Hadamard tests to show measurement collapse and interference.
AI-written summary · about
chapters (19)
- 0:00Introduction
- 8:30Molecules
- 13:30Bean Plant
- 17:20Building Quantum Code
- 21:03Inverter
- 23:00Vectors
- 27:20Complex Numbers
- 30:02Superpose State
- 32:10Infinite Values
- 37:45Electrons
- 38:56Trains
- 39:43Madonnas as halves
- 41:16Meyer on a particle
- 41:32Bake with Pisa
- 43:13What is a Quantum Computer
- 44:42Quantum Computers in the Cloud
- 46:35QSharp Open Source
- 48:43Quantum weirdness table
- 55:41Questions
related talks
59mQuantum Computing Concepts
54m“Hello, Multiverse!” - Quantum Computing and You
55m"Hello, Multiverse!" - Quantum Computing and You
28mThe future of computing with Quantum Computing
55mQuantum computers and quantum programming
42mIntroduction to Quantum Computing
28mQuantum Computing: The next new technology in computing
47mQuantum Computing and You
