I would like to point out a common misconception about quantum computing. While you may try, let’s say, a million possibilities at once, after that your chance of actually measuring the one scenario you are interested in would also be one in a million. There are however some specific problems, that can be solved fundamentally faster on a quantum computer, the one a lot of people are going crazy about is factorizing primes, since that would break a lot of asymmetric key encryptions.
You are viewing a single comment's thread from: