Quantum Computing for Computer Scientists
Microsoft Research · 12 则 HN 推荐
视频问答
可以让 AI 解释当前片段，或总结整部视频。如果回答附有时间戳，点击即可跳到对应片段。
试着问：这里讲的是什么意思？
需要用 Google 登录。确认前可查看最多会扣除多少积分。
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.
HN 推荐的原因： 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” 阅读 HN 讨论 ↗