God really plays dice - Introduction to Quantum Computing with Q#
summary
Overview of concrete claims and demos: Q# and the Quantum DevKit (compiler, simulator, debugger all rewritten in Rust and runnable in WASM) compiles to QIR and connects to Azure Quantum, with a resource estimator to predict hardware needs. Demonstrations show the H gate producing a 50/50 distribution over 10,000 runs and applying H twice yields deterministic zero; entanglement yields perfectly correlated pairs (50/50) and an 8‑qubit entangled key example produces identical bytes; complexity claim: 2^286 ≈ 10^86 states for a penicillin-level simulation.
AI-written summary · about
chapters (14)
- 0:00Welcome and introduction
- 1:52Quantum computing basics
- 8:55Q# language overview
- 12:23Classical vs quantum bits
- 20:31Einstein and quantum randomness
- 22:14Exponential growth of quantum states
- 24:01Quantum circuits and gates
- 26:52Superposition in practice
- 30:45Quantum parallelism
- 33:13Deutsch’s algorithm analogy
- 36:49Quantum entanglement explained
- 41:31Spooky action at a distance
- 45:00Quantum cryptography demo
- 49:14Closing and Q&A
related talks
01h 02mQuantum Computing Concepts
26mQuantum Leap: Revolutionizing Rust Software Development
41mQuantum Computing deep dive
53mThe quantum computers are coming
52mIs Quantum Computing Really a Thing?
02h 42mQuantum Computing Exposed: Deep Dive
55m"Hello, Multiverse!" - Quantum Computing and You
46mThe Big Quantum Theory: An Azure Story