IonQ has revealed that a quantum computer equipped with 20,000 physical qubits could crack the secp256k1 encryption standard, which secures Bitcoin, in slightly less than 26 days. This finding, detailed in a recently released paper, substantially shortens the previously predicted timeline for potential cryptographic weaknesses, which were thought to emerge in the 2030s. The dedicated research team at IonQ refined the algorithm, compiler, hardware, and error correction techniques to arrive at this conclusion, concentrating on secp256k1 due to its status as “one of the most rigorously evaluated cryptographic standards currently in use.” According to Niccolo de Masi, Chairman & CEO of IonQ, “Our paper thoroughly illustrates that IonQ’s comprehensive approach yields exceptional capabilities.”
IonQ’s 20,000-Qubit System Expected to Compromise secp256k1 in 26 Days
IonQ predicts that a quantum computer with 20,000 physical qubits could dismantle secp256k1—the elliptic curve encryption fundamental to Bitcoin and other blockchain technologies—in just under 26 days, a timeline far more rapid than past estimates that suggested threats would arise in the 2030s. This analysis is based on concrete data; the company’s research team meticulously aligned all operations with actual error-correcting techniques specific to their architecture, thus creating a verifiable framework for computational feasibility. Their detailed model comprises 1,457 logical qubits and 39 million Toffoli gates functioning at the logical level, reflecting IonQ’s public hardware development plans set for around 2028.
According to John Gamble, VP of Architecture at IonQ, this comprehensive estimation signifies a transition from theoretical risk analysis to explicit engineering strategy. He remarked, “This thoroughness is what transforms a resource estimate into a practical engineering framework. The hardware resource requirement for this computation aligns with the scale of systems we are currently developing.” This initiative goes beyond merely demonstrating cryptographic vulnerabilities; it validates IonQ’s holistic strategy by integrating algorithms, compiler development, hardware configuration, and error correction methods.
The published research, which has been peer-reviewed, builds upon the innovative Walking Cat architecture first introduced in April 2026 and employs trapped ions along with quantum LDPC codes. The importance of these findings is now recognized by major companies and the U.S. government, especially following the recent White House executive order on quantum security. IonQ underscores that these results should be interpreted as a milestone in capability, presenting a re-engineered solution to long-standing issues rather than merely indicating a cybersecurity vulnerability.
Martin Roetteler, VP of Quantum Applications R&D, mentioned that this all-inclusive approach is being utilized across IonQ’s broader initiatives, which encompass various fields such as chemistry, finance, materials science, and defense. IonQ adhered to responsible disclosure procedures by sharing preliminary findings with government and industry partners prior to publication. The company notes that the identified risk pertains to authentication and integrity issues rather than data confidentiality. Although the study underscores a potential threat, strategies for mitigation, such as Stateless Hash-Based Digital Signature Algorithm and ML-DSA, are already in place. IonQ advocates for continued cryptographic flexibility and layered defense approaches to counter evolving quantum challenges.
As our groundbreaking paper illustrates in detail, IonQ’s advanced full-stack methodology offers remarkable capabilities. We are on track to deliver our fully fault-tolerant 10,000 physical qubit system by 2027, with substantial advancements expected in our laboratories, manufacturing, and deployments by 2028.
Niccolo de Masi, Chairman & CEO, IonQ
Visit Quantum Zeitgeist for the latest news in quantum computing, including advancements in qubits, hardware, algorithms, and industry developments.
