Skip to content
Shor's Algorithm for Quantum Computing - Computerphile episode artwork

Sep 5, 2026 46 min

Shor's Algorithm for Quantum Computing - Computerphile

from Computerphile Hosted by Computerphile

We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm. Phil's accompanying blog post: https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/ Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphileThis video was filmed and edited by Sean Riley.Computerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Shor's Algorithm for Quantum Computing - Computerphile

0:00 46:43

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Computerphile?

This episode is 46 minutes long.

When was this Computerphile episode published?

This episode was published on September 5, 2026.

Can I download this Computerphile episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.