PickVidsHow Quantum Computers Break Encryption | Shor's Algorithm Explained
推荐理由
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing.
说明
这是2019年由minutephysics发布的一部讲解，主题归在Quantum computing。它讲的是quantum computing这一支里的具体问题，而不是把整个领域扫一遍。适合按兴趣直接看、不打算先补课的人。内容上可以概括成：MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.这些读者给出的理由，核心是：HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.讲法不绑某一条新闻，过几年仍然可以当材料看。从2019年到2023年，有3位不同的读者在3个不同月份把它推荐出来，其中明确叫别人去看的有0次。适合用一集把一个概念补上的人。抓住它用的那个图像或类比，比背公式重要。如果已经会了基本定义，就把注意力放在它怎么把quantum computing变成能跟着复述的例子。
视频信息
- 频道
- minutephysics
- 时长
- 17 分 31 秒
- 发布年份
- 2019
同主题更多
- Quantum Computing for Computer Scientists
- The Mathematics of Quantum Computers | Infinite Series
- 35C3 - The year in post-quantum crypto
- Hacking at Quantum Speed with Shor's Algorithm | Infinite Series
- Quantum Expert Insight: Peter Shor
- Quantum Computing Expert Explains One Concept in 5 Levels of Difficulty | WIRED