3.4M views · May 1, 2019 · 17:31 · 3 HN recommenders · 3 mentions · discussed 2019–2023
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 Hacker News points people here: 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.”HN comment, 2019
“Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing.”
Really good explanation of Shor's algorithm and quantum computing
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. this video And the followup: link
“There's also this video which walks through how quantum computers solve a very specific factoring problem”
Walks through quantum factoring that classical computers cannot match
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
“Also Minute Physics video for the Shor's Algorithm is good explaination”
Good explanation of Shor's algorithm
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
