Two new research papers suggest cryptographically relevant quantum computing may arrive sooner than expected. Independent teams have demonstrated that breaking 256-bit elliptic-curve cryptography requires far fewer resources than previously estimated—one approach needs 100 times less overhead while another achieves a 20-fold reduction in quantum circuit complexity.

A Google research team developed quantum circuits capable of breaking bitcoin's underlying secp256k1 elliptic curve in under 10 minutes using fewer than 1,200 logical qubits. Meanwhile, researchers using neutral atom qubits showed they could crack the same encryption in 10 days with just 30,000 physical qubits—orders of magnitude more efficient than earlier projections. These advances leverage new quantum architectures that allow qubits to interact non-locally, dramatically improving error correction efficiency.

The findings underscore accelerating progress toward practical cryptographically relevant quantum computing. While neither paper has undergone peer review, cryptography experts note these developments represent meaningful steps down the road to CRQC. The research highlights the urgency of transitioning to post-quantum cryptography standards as quantum computing capabilities continue advancing faster than anticipated.