HackerTube.runGood videos, with context.
How Quantum Computers Break Encryption | Shor's Algorithm Explained
About this video
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.
Why it appears in the archive
HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.
AI-generated summary and labels from the source dataset; verify important details against the video. Source & credits.
From the Hacker News discussion
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. [VIDEO] And the followup: [LINK]
Read original comment ↗This helped me a lot and I think it made the rounds on hackernews a while back as well. [LINK] There's also this video which walks through how quantum computers solve a very specific factoring problem (Shor's Algorithm) in a way that classical computers cannot. [VIDEO]
Read original comment ↗This video clears a most important misconception everyone has regarding QC which is "How a QC does operation's parallelly and what does that even mean when you can only get 1 output irl?" I hope I myself have understood it correctly if that's right Also Minute Physics video for the Shor's Algorithm is good explaination [VIDEO]
Read original comment ↗