Quantum computers need vastly fewer resources than though...
Is coming, and it clutched't be as expensive as thought. Here's what you need to know.
What’s Happening
So get this: Is coming, and it clutched’t be as expensive as thought.
]] CRYPTOGRAPHICally RELEVANT QUANTUM COMPUTING Quantum computers need vastly fewer resources than thought to break vital encryption No, the sky isnt falling, but Q Day is coming, and it wont be as expensive as thought. Dan Goodin – Mar 31, 2026 2:25 pm | 38 Credit: vital Credit: vital Text settings Story text Size Small Standard Large Width * Standard Wide Links Standard Orange * rs only Learn more Minimize to nav Building a utility-grow quantum computer that can crack one of the most vital cryptosystems—elliptic curves—doesn’t require nearly the resources anticipated just a year or two ago, two independently written whitepapers have concluded. (plot twist fr)
In one, researchers demonstrated the use of neutral atoms as reconfigurable qubits that have free access to each other.
The Details
They went on to show this approach could allow a quantum computer to break 256-bit elliptic-curve cryptography (ECC) in 10 days while using 100 times less overhead than before estimated. In a second paper, Google researchers demonstrated how to break ECC-securing blockchains for bitcoin and other cryptocurrencies in less than nine minutes while achieving a 20-fold resource reduction.
Taken together, the papers are the latest sign that cryptographically relevant quantum computing (CRQC) at utility-grow is making meaningful progress. The advances are largely being driven architectures developed computer scientists in a push to create quantum computers that operate correctly even in the presence of errors that occur whenever qubits—the quantum analog to classical computing bits—interact with their environment.
Why This Matters
The other key drivers are ever-more efficient algorithms to supercharge Shor’s algorithm, the 1994 series of equations proving that quantum computing could break the ECC and RSA cryptosystems in polynomial time, specifically cubic time , far faster than the exponential time provided by today’s classical computers. Neither paper has been peer-reviewed.
This could have major implications for how we use technology going forward.
The Bottom Line
This story is still developing, and we’ll keep you updated as more info drops.
What do you think about all this?
Daily briefing
Get the next useful briefing
If this story was worth your time, the next one should be too. Get the daily briefing in one clean email.
Reader reaction
