Hacking at Quantum Speed with Shor's Algorithm | Infinite Series

What people said

fossuser · 2019-10 · Recommendation

I'd recommend Charles Petzold's Code: [LINK] Which does a great job building up computing from bits all the way to a adders, CPUs, and assembly language (with the historical background around it too). I think the easiest way to get an idea for Quantum Computing and what the difference is comes from watching a specific example, I thought this example of Shor's algorithm was pretty good: [VIDEO]

Read the original HN comment ↗

msclrhd · 2018-11 · Recommendation

It's not that they can execute a computation faster in the traditional sense. It is that you can exploit the quantum behaviour in some types of computation (e.g. factoring primes) to make the answer more probable, and thus more likely to be "observed", when you read the state of the quantum computer and thus make it easy to locate the correct answer compared to traditional algorithms. PBS Infinite Series has several videos on quantum computing and Shor's algorithm: 1. [LINK] "The Mathematics of Quantum Computers" 2. [LINK] "How to Break Cryptography" 3. [VIDEO] "Hacking at Quantum Speed with Shor's Algorthm"

Read the original HN comment ↗

adamisntdead · 2018-04 · Recommendation

You should check out these videos, one of them might give you an understanding! - [LINK] | Quantum Computers Explained - [LINK] | The Mathematics of Quantum Computers - [VIDEO] | Hacking at Quantum Speed with Shor's Algorithm - [LINK] | A series by the author of the standard textbook These are videos I particularly like!

Read the original HN comment ↗