481

submitted 1 month ago by laserm@lemmy.world to c/196

71 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] killingspark@feddit.org 5 points 1 month ago* (last edited 1 month ago)

then we'll be able to get a lot more computing power.

I think that's not quite true it depends on what you want to calculate. Some problems have more efficient algorithms for quantum computing (famously breaking RSA and other crypto algorithms). But something like a matrix multiplication probably won't benefit.

[-] SmoothOperator@lemmy.world 2 points 1 month ago

It's actually expected that matrix inversion will see a polynomial increase in speed, but with all the overhead of quantum computing, we only really get excited about exponential speedups such as in RSA decryption.