50 points

About how far does this leave us from a usable quantum processor? How far from all current cryptographic algorithms being junk?

permalink
report
reply
69 points

The latest versions of TLS already have support post-quantum crypto, so no, it’s not all of them. For the ones that are vulnerable, we’re way, way far off from that. It may not even be possible to have enough qbits to break those at all.

Things like simulating medicines, folding proteins, and logistics are much closer, very useful, and more likely to be practical in the medium term.

permalink
report
parent
reply
15 points

Is there gov money in folding proteins though? I assume there’s a lot of 3 letter agencies what want decryption with a lot more funding.

permalink
report
parent
reply
23 points

There’s plenty of publicly funded research for that, yes.

Three letter agencies also want to protect their own nation’s secrets. They have as much interest in breaking it as they do protecting against it.

permalink
report
parent
reply
12 points

At least a week, probably more

permalink
report
parent
reply
4 points

Algorithms will be easier and faster to fix than the process of getting this breakthrough to viability

permalink
report
parent
reply
15 points

Maybe they can use the same techniques for keeping their product management and feature roadmap for more than an hour.

permalink
report
reply
14 points

Just in time for the fall of American democracy. What could possibly go wrong.

permalink
report
reply
10 points

Seeing quantum computers work will be like seeing mathemagics at work, doing it all behind the scenes. Physically (for the small ones) it looks the same, but abstractly it can perform all kinds of deep mathematics.

permalink
report
reply
10 points

108 qubits, but error correction duty for some of them?

What size RSA key can it factor “instantly”?

permalink
report
reply
8 points
*

Currently none, I think it’s allegedly 2000 qbits to break RSA

permalink
report
parent
reply
1 point

afaik, without a need for error correction a quantum computer with 256 bits could break an old 256 bit RSA key. RSA keys are made by taking 2 (x-1 bit) primes and multiplying them together. It is relatively simple algorithms to factor numbers that size on both classsical and quantum computers, However, the larger the number/bits, the more billions of billions of years it takes a classical computer to factor it. The limit for a quantum computer is how many “practical qubits” it has. OP’s article did not answer this, and so far no quantum computer has been able to solve factoring a number any faster than your phone can in under a half second.

permalink
report
parent
reply

Technology

!technology@lemmy.world

Create post

This is a most excellent place for technology news and articles.


Our Rules


  1. Follow the lemmy.world rules.
  2. Only tech related content.
  3. Be excellent to each another!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, to ask if your bot can be added please contact us.
  9. Check for duplicates before posting, duplicates may be removed

Approved Bots


Community stats

  • 15K

    Monthly active users

  • 13K

    Posts

  • 566K

    Comments