3 ms·
The article on QC I got the most out of: http://www.scottaaronson.com/blog/?p=208 http://www.scottaaronson.com/blog/?p=208 Very visual example of how Shor's al
by daxfohl 9y ago
The article on QC I got the most out of: http://www.scottaaronson.com/blog/?p=208 http://www.scottaaronson.com/blog/?p=208
Very visual example of how Shor's algorithm works to solve factoring. Nothing more than basic arithmetic required.
The big takeaway for me was, it's not just "try every combination at once" as per pop lit on the subject. QC doesn't really do that. To get QC to work any better that traditional for any task, you need to get lucky and stumble across an algorithm that QC can excel at for that task. Just from reading Scott Aaronson's article, it seems likely that most tasks simply don't have a QC optimization, so perhaps QC won't change much at all. (Well, except cryptography, which may change everything...)
- chadcmulligan 9y agoYes, this was a bit of a surprise for me to - "In fact, in general solving NP-hard problems in polynomial time with quantum computers is not believed to be possible"