4 ms·
Why isn't it defined in terms of the solvable problems? This quantum computer can factor an n-bit composite number seems like a fairly objective test.
by darawk 7y ago
Why isn't it defined in terms of the solvable problems? This quantum computer can factor an n-bit composite number seems like a fairly objective test.
- fsh 7y agoIt's a marketing problem. Shor's algorithm seems to be extremely hard to run without cheating by "optimizing" the program on a classical computer that already knows the answer. Nobody wants to announce that they barely managed to factor 21 or something like that, while at the same time trying to convince the public that their system is somehow superior to classical computers.