Article:Ryan Babbush, Adam Zalcman, Craig Gidney, Michael Broughton, Tanuj Khattar, Hartmut Neven, Thiago Bergamaschi, Justin Drake, Dan Boneh
Quantum Vulnerabilities in Cryptocurrencies: Resource Estimates and Mitigations
A research team including Ryan Babbush, Justin Drake, and Dan Boneh presents updated resource estimates for breaking 256-bit elliptic curve cryptography on quantum hardware. Shor's algorithm can solve the 256-bit Elliptic Curve Discrete Logarithm Problem using <1200 logical qubits and <90 million Toffoli gates, or <1450 logical qubits and <70 million Toffoli gates. On superconducting architectures, this could execute in minutes using fewer than 500,000 physical qubits.