Quantum Computing for Computer Scientists

FROM THE SOURCE CARD / AI-WRITTEN

What this video covers

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.

How the source describes its HN context

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.

These descriptions and labels come from the original dataset’s AI-assisted curation. They are not our personal review. Check the video and the linked discussion for context.