• killingspark@feddit.org
    link
    fedilink
    English
    arrow-up
    5
    ·
    edit-2
    3 months 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
      link
      fedilink
      arrow-up
      2
      ·
      3 months 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.