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

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!

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"

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]

A note for the savvy: A quantum computer is not a magic bit-string that mysteriously flips to the correct answer. A n-qubit quantum computer is not like 2^n phantom computers running at the same time in some quantum superposition phantom-zone. That's the popular misconception, but it's effectively ignorant techno-woo. Here's what really happens. If you have a string of n-qubits, when you measure them, they might end up randomly in of of the 2^n possible configurations. However, if you apply some operations to your string of n-qubits using quantum gates, you can usefully bias their wave equations, such that the probabilities of certain configurations are much more likely to appear. (You can't have too many of these operations, however, as that runs the risk of decoherence .) Hopefully, you can do this in such a way, that the biased configurations are the answer to a problem you want to solve. So then, if you have a quantum computer in such a setup, you can run it a bunch of times, and if everything goes well after enough iterations, you will be able to notice a bias towards certain configurations of the string of bits. If you can do this often enough to get statistical significance, then you can be pretty confident you've found your answers. [LINK] [VIDEO] EDIT: I rather like Issac Arthur, but unfortunately, his Quantum Computing episode is an example of exactly this kind of popular misconception. I've called him out on it in comments. [LINK] EDIT: I can't find my comment anym