Skip to content
Hallway
0:00 / 0:00

#shor'salgorithm#quantumcomputing#rsa

Hacking at Quantum Speed with Shor's Algorithm | Infinite Series

PBS Infinite Series

318K subscribers • 2 videos on Hallway

YouTube

Intermediate. Assumes working knowledge.

238K views9 years ago3 recommendations

Computer scienceSecurityQuantum computingCryptographyAlgorithms

An explanation of how quantum computers use Shor's algorithm to efficiently factor large prime numbers and break RSA cryptography.

Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: to.pbs.org/donateinfi Classical computers struggle to crack modern encryption. But quantum computers using Shor’s Algorithm make short work of RSA cryptography. Find out how. Tweet at us! @pbsinfinite Facebook: facebook.com/pbsinfinite series Email us! pbsinfiniteseries [at] gmail [dot] com Previous Episode How to Break Cryptography youtube.com/watch?v=12Q3Mrh03Gk The Mathematics Behind Quantum Computers youtube.com/watch?v=IrbJYsep45E Additional Resources: Scott Aaronson's Blog (Great Intro to Shor's Alg.):: scottaaronson.com/blog/?p=208 Shor's Original Paper:: arxiv.org/abs/quant-ph/9508027v2 Lectures on Shor's Algorithm:: arxiv.org/pdf/quant-ph/0010034.pdf Decrypting secure messages often involves attempting to find the factors that make up extremely large numbers. This process is too time consuming for classical computers but Shor’s Algorithm shows us how Quantum Computers can greatly expedite the process. Written and Hosted by Kelsey Houston-Edwards Produced by Rusty Ward Graphics by Ray Lux Made by Kornhaber Brown (www.kornhaberbrown.com) Thanks to Spiros Michalakis for helpful discussions and feedback. Comments answered by Kelsey: Neon Bull youtube.com/watch?v=12Q3Mrh03Gk&lc=z135uxf5cxenutmxj04cc3swk… Bhargav R youtube.com/watch?v=12Q3Mrh03Gk&lc=z13qjjioozbjdrqyz04cevdrt… BobC youtube.com/watch?v=12Q3Mrh03Gk&lc=z12pjpzastylzz2qx04cjtc5j…

Why it's here

3 people recommend this

What people say. Highly recommended for its clear, step-by-step explanation of the mathematics behind Shor's algorithm and quantum computing.

adamisntdeadon Hacker News • Recommends

On “Qusim.py – A toy multi-qubit quantum computer simulator written in Python”

You should check out these videos, one of them might give you an understanding! - link | Quantum Computers Explained - link | The Mathematics of Quantum Computers - link to this video | Hacking at Quantum Speed with Shor's Algorithm - link | A series by the author of the standard textbook These are videos I particularly like!
View on Hacker News

msclrhdon Hacker News • Recommends

On “The Case Against Quantum Computing”

It's not that they can execute a computation faster in the traditional sense. It is that you can exploit the quantum behaviour in some types of computation (e.g. factoring primes) to make the answer more probable, and thus more likely to be "observed", when you read the state of the quantum computer and thus make it easy to locate the correct answer compared to traditional algorithms. PBS Infinite Series has several videos on quantum computing and Shor's algorithm: 1. link "The Mathematics of Quantum Computers" 2. link "How to Break Cryptography" 3. link to this video "Hacking at Quantum Speed with Shor's Algorthm"
View on Hacker News

fossuseron Hacker News • Recommends

On “Quantum supremacy: the gloves are off”

I'd recommend Charles Petzold's Code: link Which does a great job building up computing from bits all the way to a adders, CPUs, and assembly language (with the historical background around it too). I think the easiest way to get an idea for Quantum Computing and what the difference is comes from watching a specific example, I thought this example of Shor's algorithm was pretty good: link to this video
View on Hacker News

stcredzeroon Hacker News • Mentions

On “An Argument Against Quantum Computers”

…ou have a quantum computer in such a setup, you can run it a bunch of times, and if everything goes well after enough iterations, you will be able to notice a bias towards certain configurations of the string of bits. If you can do this often enough to get statistical significance, then you can be pretty confident you've found your answers. link link to this video EDIT: I rather like Issac Arthur, but unfortunately, his Quantum Computing episode is an example of exactly this kind of popular misconception. I've called him out on it in comments. link EDIT: I can't find my comment anym…
View on Hacker News