aiqbenchInformații despre AI & calcul cuantic

...

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

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.

Sursă care acoperăQuantum Computing Report

Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

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

Quantum Computing Report8 septembrie 20263 min de cititArticolul și perspectiva sunt în engleză.

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…

Extras afișat conform termenilor RSS ai publicației · 46 cuvinte · textul integral și figurile sunt pe site-ul publicației

Citește pe Quantum Computing Report ↗Întreabă despre acest articol