aiqbench takeQuantum Computing

IonQ has released a rigorous resource estimate demonstrating that a fault-tolerant quantum computer using its "Walking Cat" architecture could break 256-bit elliptic curve cryptography in approximately 25.7 days. This study provides a concrete blueprint for executing Shor's algorithm on secp256k1, underscoring the urgency of migrating to post-quantum cryptographic standards before such hardware becomes commercially viable.

Source coveringQuantum Computing Report

What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

IonQ Publishes End-to-End Fault-Tolerant Resource Estimate for Shor’s Algorithm on 256-Bit Elliptic Curves

Quantum Computing ReportSeptember 8, 20263 min read

IonQ has published a study detailing a fault-tolerant quantum computing architecture capable of breaking 256-bit elliptic curve cryptography, such as that securing Bitcoin, in 25.7 days. Their optimized "Walking Cat" architecture utilizes qLDPC codes and 19,397 physical qubits to achieve this, highlighting the future vulnerability of current cryptographic standards and urging migration to post-quantum alternatives. The post IonQ Publishes End-to-End Fault-Tolerant Resource Estimate for Shor’s Algorithm on 256-Bit Elliptic Curves appeared first on Quantum Computing Report.

Trapped-ion quantum platform developer IonQ (NYSE: IONQ) has published an architectural resource estimation study providing a fully compiled, end-to-end blueprint for executing Shor’s algorithm to solve the 256-bit elliptic curve discrete logarithm problem (ECDLP) on the secp256k1 curve. Utilizing an optimized variant of its fault-tolerant “Walking…

Excerpt shown under the publisher's RSS terms · 46 words · full text and figures are on the publisher's site

Read at Quantum Computing Report ↗Ask about this article