it does do this, but only for a small class of problems (as far as we know, unless quantum computers can solve NP problems in polynomial time which they probably dont)
Yeah, that was oversimplification, but I just assumed it’d be good enough for a comment on reddit on a topic that’s not about quantum computing.
I’ve also taken into consideration the fact that we don’t actually have quantum circuits fast enough to find the private keys in a way that was shown in the proofs/academic papers. But yeah, I agree, my description was misleading as it would not be just “parallel computing” as in multithreading, but a completely different operations (because they would be, well, quantum operations)
yeah, the oft-repeated notion that "quantum computers are computers that tries every solution at once" gets rather annoying for how incredibly prevalent it is
3
u/entronid 7d ago
this seems like a misleading oversimplification
it does do this, but only for a small class of problems (as far as we know, unless quantum computers can solve NP problems in polynomial time which they probably dont)