Claude cuts quantum circuit gate count for elliptic curves by 17x
- —Circuit uses 17x fewer gates but 12% more qubits than prior designs
- —Claude improved eight quantum primitives, beating published results in seven
- —Produced the first reversible divsteps implementation without branch history
- —DQI decoder gate count fell about 12x versus Google Quantum AI's design
Why it matters: Cheaper quantum circuits for the elliptic-curve discrete log problem bring closer a threat to ECDSA, which secures Bitcoin and Ethereum.
Source: ForkLog