Quantum Computing for Computer Scientists

An 88-minute Microsoft Research talk that explains how quantum computers beat classical ones using basic linear algebra, qubits, superposition and gates. It works through the Deutsch oracle problem and ends with entanglement, teleportation and a live demo.

Why HN recommends it: It is HN's most frequently recommended starting point for quantum computing because it avoids pop-science hand-waving and needs only basic linear algebra.

“This video is the simplest explanation that I have found for Quantum Computing” Read on HN ↗