Nvidia released a quantum error-correction decoding algorithm on Monday that it says runs up to 13,000 times faster than existing leading methods, and cuts the computation time for researching new quantum designs from 12 weeks to 45 minutes. The announcement, made with IBM and Fermilab, lands in the middle of a running argument about how soon a quantum computer could break Bitcoin’s elliptic-curve signatures.
The algorithm lets researchers evaluate designs that use physical qubits more efficiently, which Nvidia describes as shortening the path to practical fault-tolerant quantum computing. Error rates are the binding constraint on the field: noisy qubits limit the complexity and duration of the computations a machine can perform, so better decoding is progress toward machines that hold a calculation together long enough to be useful.
Nvidia and IBM also announced a modular codesign platform with Fermilab, placing Nvidia DGX B200 systems next to IBM quantum computers, including those powered by the Nighthawk processor, so researchers can develop and test error-correction codes on the combined system. “Making quantum computers useful for science requires advances in error correction, applications and the systems that bring quantum processors and accelerated computing together,” said Krysta Svore, vice president of applied research for quantum computing at Nvidia.
The distance to a Bitcoin break remains large. A 2022 study by University of Sussex researchers estimated that breaking Bitcoin’s encryption within a day would require around 13 million physical qubits. IBM’s Nighthawk, which the company calls its fastest processor, has 120.
Preparation on the Bitcoin side has focused on moving coins off address types whose public keys are already visible. Developer Hunter Beast proposed BIP-360 in 2024 as a new output type designed to resist quantum attack, and Casa co-founder Jameson Lopp outlined a plan in July 2025 to phase out legacy signatures and migrate balances to quantum-resistant addresses. Coins mined by Satoshi Nakamoto sit on addresses whose public keys have been exposed since they were spent into, which makes them a permanent test case for any migration plan. In November 2024, NIST proposed retiring vulnerable public-key algorithms, including elliptic curve cryptography, after 2035.
None of Monday’s announcements changes those timelines by itself. What they change is the research cycle: a design loop compressed from months to under an hour accelerates the iteration that produces fault-tolerant hardware, and that is the variable the migration debate actually depends on.