The technical goal is a quantum computation that recovers an elliptic-curve private key from its public key at a size used by deployed systems, executed reliably enough to matter. Published resource estimates for that computation have fallen as arithmetic circuits, compilation, and error-correction schemes have improved, and hardware demonstrations have moved fault tolerance from theory toward engineering. Neither trend shows that deployed cryptography is broken today.
Three kinds of work must come together. Circuit improvements reduce the logical resources a computation needs. AI research infrastructure widens the set of candidate improvements that can be proposed, tested, and recorded. Hardware integration determines whether a logical circuit can actually execute on a specific machine, with its architecture, error characteristics, and interfaces. A better circuit alone is not a computation, and a machine alone is not an attack.
- Cryptanalytic workloadElliptic-curve key recovery and its arithmetic kernels
- Quantum algorithmsReduce logical resources for reversible arithmetic
- Circuit compilationCompile and optimize for fault-tolerant execution
- Mapping & schedulingPlace operations and schedule limited resources
- Control & runtime integrationWork within interfaces exposed by providers
- Quantum hardwareExternalDeveloped and operated by specialist providers