How Quantum Computers Break Encryption | Shor's Algorithm Explained on HackerTube: recommended by 3 Hacker News commenters across 3 separate months, 2019–2023.
explainer · evergreen
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.
“Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing.”
3 Hacker News comments link this video. Each one links back to its thread.
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 ▶ this video
in “Quantum Computing 101” · View on HN
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. ▶ this video
in “What makes quantum computing so hard to explain?” · View on HN
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. ▶ this video And the followup: [link]
in “Quantum supremacy: the gloves are off” · View on HN