The Quantum Threat to Blockchains

Citations

  1. Google Quantum AI and Collaborators. Quantum error correction below the surface code threshold. Nature 638, 920–926 (2025). https://doi.org/10.1038/s41586-024-08449-y
  2. Babbush, Ryan, et al. “The Quantum Threat to Elliptic Curve Cryptocurrencies: Resource Estimates, Vulnerabilities, and Mitigations.” Google Quantum AI, 25 Mar. 2026.
  3. Cain, Madelyn, et al. “Shor’s Algorithm Is Possible with Approximately 10,000 Reconfigurable Atomic Qubits.” Oratomic, 26 Mar. 2026.
  4. Shor, Peter W. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring.” Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE, 1994, pp. 124-134. DOI: 10.1109/SFCS.1994.365700.
  5. Grover, Lov K. ‘A Fast Quantum Mechanical Algorithm for Database Search’. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1996, pp. 212–219, https://doi.org/10.1145/237814.237866. STOC ‘96.
  6. Gidney, Craig. “How to Factor 2048 Bit RSA Integers with Less than a Million Noisy Qubits.” arXiv, 2025, arxiv.org/abs/2505.15917.
  7. Ivezic, Marin. “CRQC Quantum Capability Framework.” Post-Quantum, postquantum.com/post-quantum/crqc-quantum-capability-framework/#75-how-each-capability-moves-lqc-lob-and-qot. Accessed 30 Mar. 2026.
  8. “Quantum Benchmark Zoo.” Quantumbenchmarkzoo.org, 2021, quantumbenchmarkzoo.org/content/system-level-benchmark/others/clops.
  9. Mosca, Michele, and Marco Piani. Quantum Threat Timeline Report 2025. evolutionQ Inc. and Global Risk Institute, Mar. 2026. Global Risk Institute, www.globalriskinstitute.org.
  10. Webster, P., et al. “The Pinnacle Architecture: Reducing the Cost of Breaking RSA-2048 to 100,000 Physical Qubits Using Quantum LDPC Codes.” arXiv, 2026, arxiv.org/abs/2602.11457.
  11. Ivezic, Marin. “No, the ‘Pinnacle Architecture’ Is Not Bringing Q-Day Closer 2-5 Years (but It Is Credible Research).” PostQuantum — Quantum Computing, Quantum Security, PQC, 13 Feb. 2026, postquantum.com/security-pqc/pinnacle-architecture-q-day/. Accessed 30 Mar. 2026.
  12. Mundada, Pranav S., et al. “Heterogeneous Architectures Enable a 138x Reduction in Physical Qubit Requirements for Fault-Tolerant Quantum Computing under Detailed Accounting.” arXiv, 13 Apr. 2026.
  13. Gu, Andi, et al. “Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation.” arXiv, 9 Apr. 2026.
  14. Huang, H., et al. “Optimized Quantum Circuits for Ed25519 Elliptic Curve Discrete Logarithm.” Quantum Information Processing, vol. 24, 2025.
  15. Regev, Oded. “An Efficient Quantum Factoring Algorithm.” arXiv, 2024, arxiv.org/abs/2308.06572.
  16. Deegan, C. “Quantum Vulnerability of Bitcoin Addresses.” Project Eleven Blog, July 2025, blog.projecteleven.com/posts/quantum-vulnerability-of-bitcoin-addresses.
  17. Deegan, C. “HD Wallets & Quantum Risk: Does Reusing One Address Endanger the Rest?” Project Eleven Blog, Aug. 2025, blog.projecteleven.com/posts/hd-wallets—quantum-risk-does-reusing-one-address-endanger-the-rest.
  18. “Bitcoin Risq List.” Project Eleven, www.projecteleven.com/bitcoin-risq-list.
  19. “Quantum Attack Vectors in Ethereum.” Project Eleven Blog, blog.projecteleven.com/posts/quantum-attack-vectors-in-ethereum.
  20. “Quantum Risk to the Ethereum Blockchain.” Deloitte Netherlands, 2025, www.deloitte.com/nl/en/services/consulting-risk/perspectives/quantum-risk-to-the-ethereum-blockchain.html.
  21. “How Blockchains Will Evolve for the Quantum Era — Part 2.” Fireblocks, July 2025, www.fireblocks.com/blog/how-blockchains-will-evolve-for-the-quantum-era.
  22. “Stablecoin Market Tops $317 Billion.” MEXC News, Jan. 2026, www.mexc.co/news/421705; “Circle’s USDC Outpaces Growth of Tether’s USDT for Second Year Running.” CoinDesk, Jan. 2026, www.coindesk.com/markets/2026/01/06/circle-s-usdc-outpaces-growth-of-tether-s-usdt-for-second-year-running.
  23. “Stablecoin Market Share and Transaction Volume — September 2025 Data.” CoinLedger, coinledger.io/research/stablecoin-market-share-and-transaction-volume.
  24. “Stablecoin Market Tops $317 Billion.” MEXC News, Jan. 2026, www.mexc.co/news/421705; “Circle’s USDC Outpaces Growth of Tether’s USDT for Second Year Running.” CoinDesk, Jan. 2026, www.coindesk.com/markets/2026/01/06/circle-s-usdc-outpaces-growth-of-tether-s-usdt-for-second-year-running.
  25. Kearney, J., and C. Deegan. “Vulnerabilities of Stablecoins to Quantum Attacks.” Project Eleven Blog, July 2025, blog.projecteleven.com/posts/vulnerabilities-of-stablecoins-to-quantum-attacks.
  26. Deegan, C., and J. Kearney. “Quantum vs. USDC: A Threat Analysis of Circle’s Smart-Contract.” Project Eleven Blog, July 2025, blog.projecteleven.com/posts/quantum-vs-usdc-a-threat-analysis-of-circles-smart-contract.
  27. “FIPS 203: Module-Lattice-Based Key-Encapsulation Mechanism Standard.” National Institute of Standards and Technology (NIST), csrc.nist.gov/pubs/fips/203/final.
  28. “FIPS 204: Module-Lattice-Based Digital Signature Standard.” National Institute of Standards and Technology (NIST), csrc.nist.gov/pubs/fips/204/final.
  29. “FIPS 205: Stateless Hash-Based Digital Signature Standard.” National Institute of Standards and Technology (NIST), csrc.nist.gov/pubs/fips/205/final.
  30. “Hybrid Key Exchange in TLS 1.3.” Internet Engineering Task Force (IETF), datatracker.ietf.org/doc/draft-ietf-tls-hybrid-design/.
  31. “PQ 2025.” Cloudflare Blog, blog.cloudflare.com/pq-2025/.
  32. “Radar 2025 Year in Review.” Cloudflare Blog, blog.cloudflare.com/radar-2025-year-in-review/.
  33. “A New Path for Kyber on the Web.” Google Security Blog, Sept. 2024, security.googleblog.com/2024/09/a-new-path-for-kyber-on-web.html.
  34. “Enhancing Your App’s Privacy and Security with Quantum-Secure Workflows.” Apple Developer Documentation, developer.apple.com/documentation/cryptokit/enhancing-your-app-s-privacy-and-security-with-quantum-secure-workflows.
  35. “Post-Quantum Cryptography.” OpenSSH, www.openssh.org/pq.html.
  36. “Post-Quantum Cryptography.” Amazon Web Services (AWS), aws.amazon.com/security/post-quantum-cryptography/.
  37. “Announcing Quantum-Safe Key Encapsulation Mechanisms in Cloud KMS.” Google Cloud Blog, cloud.google.com/blog/products/identity-security/announcing-quantum-safe-key-encapsulation-mechanisms-in-cloud-kms.
  38. Deegan, C. “Benchmarking Post-Quantum Cryptography.” GitHub, github.com/conor-deegan/benching-pq.
  39. Beast, H. “BIP 360.” BIP 360, bip360.org/.
  40. Lopp, J. “QBIP.” QBIP, qbip.org/.
  41. “Lean Roadmap.” Ethereum, leanroadmap.org/.
  42. Strawmap, strawmap.org/.
  43. Deegan, C. “Post-Quantum Readiness for EdDSA Chains and a Possible Solution for Some ECDSA Wallets — Part 1.” Project Eleven Blog, Aug. 2025, blog.projecteleven.com/posts/post-quantum-readiness-for-eddsa-chains-and-a-possible-solution-for-some-ecdsa-wallets---part-1.
  44. Baldimtsi, M., et al. “Post-Quantum Readiness in EdDSA Chains.” IACR Cryptology ePrint Archive, 2025, eprint.iacr.org/2025/1368.pdf.
  45. “Post-Quantum Cryptography for Engineers.” Internet Engineering Task Force (IETF), datatracker.ietf.org/doc/draft-ietf-pquip-pqc-engineers/.
  46. Campbell. “Enterprise Migration to Post-Quantum Cryptography.” MDPI, www.mdpi.com/2073-431X/15/1/9.
  47. “CNSA 2.0 Algorithms.” National Security Agency (NSA), May 2025, media.defense.gov/2025/May/30/2003728741/-1/-1/0/CSA_CNSA_2.0_ALGORITHMS.PDF.
  48. “PQC Migration Timelines.” National Cyber Security Centre (NCSC), www.ncsc.gov.uk/guidance/pqc-migration-timelines.
  49. “IR 8547: Transition to Post-Quantum Cryptography Standards.” National Institute of Standards and Technology (NIST), csrc.nist.gov/pubs/ir/8547/ipd.
  50. Pont, Jamie J., et al. ‘Downtime Required for Bitcoin Quantum-Safety’. arXiv [Quant-Ph], 2024, arxiv.org/abs/2410.16965. arXiv.
  51. Beauregard, Stephane. “Circuit for Shor’s Algorithm Using 2n+3 Qubits.” arXiv, 2003, arxiv.org/abs/quant-ph/0205095.
  52. Zalka, Christof. “Fast Versions of Shor’s Quantum Factoring Algorithm.” arXiv, 1998, arxiv.org/abs/quant-ph/9806084.
  53. Zalka, Christof. “Shor’s Algorithm with Fewer (Pure) Qubits.” arXiv, 2006, arxiv.org/abs/quant-ph/0601097.
  54. Ekerå, Martin, and Johan Håstad. “Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers.” IACR Cryptology ePrint Archive, 2017, eprint.iacr.org/2017/077.
  55. Gidney, Craig, and Martin Ekerå. “How to Factor 2048 Bit RSA Integers in 8 Hours Using 20 Million Noisy Qubits.” Quantum, vol. 5, Apr. 2021, p. 433. DOI: 10.22331/q-2021-04-15-433.
  56. Gouzien, Élie, and Nicolas Sangouard. “Factoring 2048-Bit RSA Integers in 177 Days with 13,436 Qubits and a Multimode Memory.” Physical Review Letters, vol. 127, Sept. 2021, p. 140503. DOI: 10.1103/PhysRevLett.127.140503.
  57. Litinski, Daniel. “How to Compute a 256-Bit Elliptic Curve Private Key with Only 50 Million Toffoli Gates.” arXiv, 2023, arxiv.org/abs/2306.08585.
  58. Fowler, Austin G., et al. ‘Surface Codes: Towards Practical Large-Scale Quantum Computation’. Phys. Rev. A, vol. 86, American Physical Society, Sept. 2012, p. 032324, https://doi.org/10.1103/PhysRevA.86.032324.
  59. McEwen, Matt, et al. ‘Resolving Catastrophic Error Bursts from Cosmic Rays in Large Arrays of Superconducting Qubits’. Nature Physics, vol. 18, no. 1, Springer Science and Business Media LLC, Dec. 2021, pp. 107–111, https://doi.org/10.1038/s41567-021-01432-8.
  60. Koch, Jens, et al. ‘Charge-Insensitive Qubit Design Derived from the Cooper Pair Box’. Phys. Rev. A, vol. 76, American Physical Society, Oct. 2007, p. 042319, https://doi.org/10.1103/PhysRevA.76.042319.
  61. Ke, Chung-Ting, et al. ‘Scaffold-Assisted Window Junctions for Superconducting Qubit Fabrication’. arXiv [Physics.App-Ph], 2025, arxiv.org/abs/2503.11010. arXiv.
  62. Chamberland, Christopher, et al. ‘Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits’. Phys. Rev. X, vol. 10, American Physical Society, Jan. 2020, p. 011022, https://doi.org/10.1103/PhysRevX.10.011022.
  63. Panteleev, Pavel, and Gleb Kalachev. ‘Asymptotically Good Quantum and Locally Testable Classical LDPC Codes’. arXiv [Cs.IT], 2022, arxiv.org/abs/2111.03654. arXiv.
  64. Bravyi, Sergey, et al. “High-Threshold and Low-Overhead Fault-Tolerant Quantum Memory.” Nature, vol. 627, no. 8005, 1 Mar. 2024, pp. 778–782, www.nature.com/articles/s41586-024-07107-7, https://doi.org/10.1038/s41586-024-07107-7. Accessed 26 Apr. 2024.
  65. Zhu, Guanyu, et al. ‘Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes’. arXiv [Quant-Ph], 2026, arxiv.org/abs/2601.06736. arXiv.
  66. Dolev Bluvstein, et al. “A Fault-Tolerant Neutral-Atom Architecture for Universal Quantum Computation.” Nature, 10 Nov. 2025, www.nature.com/articles/s41586-025-09848-5, https://doi.org/10.1038/s41586-025-09848-5.
  67. Saffman, M., et al. ‘Quantum Information with Rydberg Atoms’. Rev. Mod. Phys., vol. 82, American Physical Society, Aug. 2010, pp. 2313–2363, https://doi.org/10.1103/RevModPhys.82.2313.
  68. Chiu, Neng-Chun, et al. “Continuous Operation of a Coherent 3,000-Qubit System.” Nature, 15 Sept. 2025, pp. 1–3, www.nature.com/articles/s41586-025-09596-6, https://doi.org/10.1038/s41586-025-09596-6.
  69. Wang, Yuqing, et al. ‘Direct Generation of an Array with 78400 Optical Tweezers Using a Single Metasurface’. Chinese Physics Letters, vol. 43, no. 1, IOP Publishing, Dec. 2025, p. 010606, https://doi.org/10.1088/0256-307x/43/1/010606.
  70. Rines, Rich, et al. ‘Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement: Shor’s Algorithm, Constant-Depth CNOT Ladder, and Many-Hypercube Code’. arXiv [Quant-Ph], 2025, arxiv.org/abs/2509.13247. arXiv.
  71. Rodriguez, Pedro Sales, et al. “Experimental Demonstration of Logical Magic State Distillation.” Nature, vol. 645, no. 8081, 14 July 2025, pp. 620–625, https://doi.org/10.1038/s41586-025-09367-3.
  72. Zhou, Hengyun, et al. “Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation.” Nature, vol. 646, no. 8084, 24 Sept. 2025, pp. 303–308, www.nature.com/articles/s41586-025-09543-5, https://doi.org/10.1038/s41586-025-09543-5. Accessed 30 Mar. 2026.
  73. Pino, J M et al. “Demonstration of the trapped-ion quantum CCD computer architecture.” Nature vol. 592,7853 (2021): 209-213. doi:10.1038/s41586-021-03318-4
  74. Sakrejda, Tomasz P., et al. ‘Efficient Sympathetic Cooling in Mixed Barium and Ytterbium Ion Chains’. arXiv [Physics.Atom-Ph], 2021, arxiv.org/abs/1809.00240. arXiv.
  75. Bartolucci, Sara, et al. “Fusion-Based Quantum Computation.” Nature Communications, vol. 14, no. 1, 17 Feb. 2023, https://doi.org/10.1038/s41467-023-36493-1.
  76. Garn, Michael, and Angus Kan. ‘Quantum Resource Estimates for Computing Binary Elliptic Curve Discrete Logarithms’. IEEE Transactions on Quantum Engineering, vol. 6, Institute of Electrical and Electronics Engineers (IEEE), 2025, pp. 1–23, https://doi.org/10.1109/tqe.2025.3586541.
  77. Charbon, E., et al. ‘Cryo-CMOS for Quantum Computing’. 2016 IEEE International Electron Devices Meeting (IEDM), 2016, p. 13.5.1-13.5.4, https://doi.org/10.1109/IEDM.2016.7838410.
  78. Hughes, A. C., et al. “Trapped-Ion Two-Qubit Gates with >99.99% Fidelity without Ground-State Cooling.” arXiv, 2025, arxiv.org/abs/2510.17286.
  79. Blume-Kohout, Robin, et al. ‘Quantum Characterization, Verification, and Validation’. arXiv [Quant-Ph], 2025, arxiv.org/abs/2503.16383. arXiv.
  80. Nielsen, Erik, et al. ‘Gate Set Tomography’. Quantum, vol. 5, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, Oct. 2021, p. 557, https://doi.org/10.22331/q-2021-10-05-557.
  81. Magesan, Easwar, et al. ‘Characterizing Quantum Gates via Randomized Benchmarking’. Phys. Rev. A, vol. 85, American Physical Society, Apr. 2012, p. 042311, https://doi.org/10.1103/PhysRevA.85.042311.
  82. Cross, Andrew W., et al. ‘Validating Quantum Computers Using Randomized Model Circuits’. Physical Review A, vol. 100, no. 3, American Physical Society (APS), Sept. 2019, https://doi.org/10.1103/physreva.100.032328.
  83. Temme, Kristan, et al. ‘Error Mitigation for Short-Depth Quantum Circuits’. Phys. Rev. Lett., vol. 119, American Physical Society, Nov. 2017, p. 180509, https://doi.org/10.1103/PhysRevLett.119.180509.
  84. Rosenfeld, Emma, et al. ‘Magic State Cultivation on a Superconducting Quantum Processor’. arXiv [Quant-Ph], 2025, arxiv.org/abs/2512.13908. arXiv.
  85. Menon, Varun, et al. ‘Magic Tricycles: Efficient Magic State Generation with Finite Block-Length Quantum LDPC Codes’. arXiv [Quant-Ph], 2025, arxiv.org/abs/2508.10714. arXiv.
  86. Breuer, Heinz-Peter, and Francesco Petruccione. The Theory of Open Quantum Systems. Oxford UP, 2006. DOI: 10.1093/acprof:oso/9780199213900.001.0001.
  87. Gardiner, C. W., and P. Zoller. Quantum Noise: A Handbook of Markovian and Non-Markovian Quantum Stochastic Methods with Applications to Quantum Optics. Springer, 2000.
  88. Leggett, A. J., et al. “Dynamics of the Dissipative Two-State System.” Reviews of Modern Physics, vol. 59, Jan. 1987, pp. 1-85. DOI: 10.1103/RevModPhys.59.1.
  89. Gottesman, Daniel. “Stabilizer Codes and Quantum Error Correction.” arXiv, 1997, arxiv.org/abs/quant-ph/9705052.
  90. Knill, Emanuel, and Raymond Laflamme. “Theory of Quantum Error-Correcting Codes.” Physical Review A, vol. 55, Feb. 1997, pp. 900-911. DOI: 10.1103/PhysRevA.55.900.
  91. Shor, Peter W. “Scheme for Reducing Decoherence in Quantum Computer Memory.” Physical Review A, vol. 52, Oct. 1995, pp. R2493-R2496. DOI: 10.1103/PhysRevA.52.R2493.
  92. Calderbank, A. R., and Peter W. Shor. “Good Quantum Error-Correcting Codes Exist.” Physical Review A, vol. 54, Aug. 1996, pp. 1098-1105. DOI: 10.1103/PhysRevA.54.1098.
  93. Kitaev, A. Yu. “Fault-Tolerant Quantum Computation by Anyons.” Annals of Physics, vol. 303, no. 1, Jan. 2003, pp. 2-30. DOI: 10.1016/s0003-4916(02)00018-0.
  94. Fowler, Austin G., et al. “Surface Codes: Towards Practical Large-Scale Quantum Computation.” Physical Review A, vol. 86, Sept. 2012, p. 032324. DOI: 10.1103/PhysRevA.86.032324.
  95. Gidney, C., et al. “Yoked Surface Codes.” Nature Communications, vol. 16, no. 4498, 2025. DOI: 10.1038/s41467-025-59714-1.
  96. Eickbusch, A., et al. “Demonstration of Dynamic Surface Codes.” Nature Physics, vol. 21, 2025, pp. 1994-2001. DOI: 10.1038/s41567-025-03070-w.
  97. Eastin, Bryan, and Emanuel Knill. “Restrictions on Transversal Encoded Quantum Gate Sets.” Physical Review Letters, vol. 102, Mar. 2009, p. 110502. DOI: 10.1103/PhysRevLett.102.110502.
  98. Bravyi, Sergey, and Alexei Kitaev. “Universal Quantum Computation with Ideal Clifford Gates and Noisy Ancillas.” Physical Review A, vol. 71, Feb. 2005, p. 022316. DOI: 10.1103/PhysRevA.71.022316.
  99. Horsman, Dominic, et al. “Surface Code Quantum Computing by Lattice Surgery.” New Journal of Physics, vol. 14, no. 12, Dec. 2012, p. 123011. DOI: 10.1088/1367-2630/14/12/123011.
  100. Tillich, Jean-Pierre, and Gilles Zemor. “Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength.” IEEE Transactions on Information Theory, vol. 60, no. 2, Feb. 2014, pp. 1193-1202. DOI: 10.1109/tit.2013.2292061.
  101. “PQC Suite-B.” GitHub, github.com/PQC-Suite-B/.
  102. Ransford, Anthony, et al. “Helios: A 98-Qubit Trapped-Ion Quantum Computer.” arXiv, 2025, arxiv.org/abs/2511.05465.
  103. Mosca, M., and M. Piani. Quantum Threat Timeline Report 2023. Global Risk Institute and evolutionQ Inc., 2023.