How Quantum Computers Break Encryption | Shor's Algorithm Explained

minutephysicsRecommended by 3 HN commenters across 3 months, 2019–2023

YouTube

explainer · general · evergreen · 2019–2023 on HN

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, an…

HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.

Quantum computing Cryptography #shor'salgorithm #quantumfactoring #cryptography #modulararithmetic

3 comments from Hacker News

@diginova2023-04 · in “Quantum Computing 101”

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

Recommends View on HN

@xmprt2021-06 · in “What makes quantum computing so hard to explain?”

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

Recommends View on HN

@glandium2019-10 · in “Quantum supremacy: the gloves are off”

Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. ▶ this video And the followup: link

Recommends View on HN