![]() Claude sets records in 7 quantum circuit tasksRead the article English (automatic translation) |
SummaryA team from Harvard and Anthropic used Claude with an evolutionary search method (OpenEvolve) to redesign quantum circuits. They improved the total Toffoli gate × qubit cost in seven out of eight tasks. The claim of a '17-fold' reduction in 256-bit elliptic curve point addition is real; however, this measurement was made against a baseline using fewer qubits, not the overall best design. |
Why it mattersQuantum algorithm costs have historically been reduced more by better circuit design than by hardware advancements. Therefore, an AI that independently proposes, implements, and verifies circuit architectures can shorten the time required for useful quantum computing without touching a single physical qubit. The model proposes, the classical oracle verifies, and the evolutionary loop repeats without human intervention. This is a general workflow that extends far beyond quantum computing. |
Highlights
|
Critical takeThe result is a preprint that has not undergone peer review or independent replication. The authors themselves acknowledge that Claude is 'conservative by nature' and had to be forced to explore parallel discoveries. Therefore, it is unclear how much of the gain comes from the model versus the evolutionary search framework. The total cost metric is explicitly arbitrary. The 17-fold claim hides qubit overhead. The elliptic curve in question is the one used by Bitcoin. Thus, the 'no threat' framing is not a neutral observation but a practical leap. |
