HackerTube.dev

How Quantum Computers Break Encryption | Shor's Algorithm Explained

minutephysics · 3.4M views · 2019-05-01 · 17:31

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

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.

On Hacker News

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

Recommended by 3 HN people across 3 months · HN mentions 2019–2023

Topics

Search by tags

What people said

diginova · 2023-04 · Recommendation

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 the original HN comment ↗
xmprt · 2021-06 · Recommendation

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 the original HN comment ↗
glandium · 2019-10 · Recommendation

Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. [VIDEO] And the followup: [LINK]

Read the original HN comment ↗

Sources

Video by minutephysics, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources