The Mathematics of Quantum Computers | Infinite Series
推荐理由
perhaps the most accessible and yet accurate explanations of quantum computing I have found so far
说明
这是2017年由PBS Infinite Series发布的一部讲解,主题归在Quantum computing。它讲的是quantum computing这一支里的具体问题,而不是把整个领域扫一遍。适合第一次接触、还没有先修课的人。内容上可以概括成:A PBS Infinite Series episode explaining the mathematics of quantum computers, including how qubits store complex numbers and how quantum computation differs from classical computation. Hosted by Kelsey Houston-Edwards.这些读者给出的理由,核心是:HN recommends it as one of the most accessible yet accurate introductions to quantum computing, and part of a wider series that covers Shor's algorithm.讲法不绑某一条新闻,过几年仍然可以当材料看。从2017年到2023年,有4位不同的读者在4个不同月份把它推荐出来,其中明确叫别人去看的有1次。适合用一集把一个概念补上的人。抓住它用的那个图像或类比,比背公式重要。如果已经会了基本定义,就把注意力放在它怎么把quantum computing变成能跟着复述的例子。
视频信息
- 频道
- PBS Infinite Series
- 时长
- 12 分 35 秒
- 发布年份
- 2017
同主题更多
- Quantum Computing for Computer Scientists
- 35C3 - The year in post-quantum crypto
- How Quantum Computers Break Encryption | Shor's Algorithm Explained
- 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