Claude proposes quantum circuits that reduce estimated gate and qubit costs
An Anthropic and Harvard preprint uses Claude to propose quantum circuits and a separate evaluator to check them. Seven of eight tasks show lower estimated gate and qubit counts under the paper's comparisons.
The big change
What changed: An evaluator-guided search produced circuit designs for eight specified quantum-computing primitives. The paper reports lower gate and qubit counts on seven tasks, with a different trade-off for modular inversion.
Why it matters: A large quantum algorithm repeatedly calls smaller routines. Reducing the resources estimated for those routines could lower the requirements of a future implementation, if the designs hold up when integrated with error correction and hardware constraints.
What to watch: Independent scrutiny of the circuit constructions, their stated error budgets and hardware-specific resource estimates will determine how far the results carry beyond these test cases.







