Mathematics & Theoretical CS

Quantum computing

Quantum computing sits within Mathematics & Theoretical CS. Approach the subject through definitions, worked reasoning, and the connections that make an abstract idea useful. This selection contains 11 catalog videos from 10 distinct channels. The examples below offer specific entry points into the subject, with their own vocabulary and scope, rather than a prescribed sequence of lessons.

Recurring catalog topics include quantum computing, cryptography, qubits, shor's algorithm, pbs infinite series and 35c3. These tags describe overlapping directions within the collection; an individual video may connect several of them. Recorded formats include explainer, lecture, news and talk. Use those differences to choose between approaches to the subject and to compare how different contributors frame related questions.

“Quantum Computing for Computer Scientists”, listed under Microsoft Research, is cataloged as talk. 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,…

“35C3 - The year in post-quantum crypto”, listed under media.ccc.de, is cataloged as talk. Daniel J. Bernstein and Tanja Lange survey recent highlights in post-quantum cryptography at 35C3, covering the NIST competition, network protocol experiments, and broken candidates.