TL;DR
Get the latest gadgets delivered free with Prime
- Fast, free delivery on millions of items
- Prime Video, Amazon Music and more included
- Member-only deals all year
Researchers from Anthropic and Harvard used Claude to design circuits for eight quantum-computing tasks. Their preprint reports lower estimated resource use for seven designs; the work was checked computationally, not demonstrated on quantum hardware.
Anthropic and Harvard researchers say they used Claude to design more resource-efficient circuits for eight quantum-computing tasks, including routines used in optimization and other algorithms. In a preprint posted to arXiv, seven designs reduced both estimated costly quantum operations and qubit requirements against the study’s baselines; the results are computational evaluations, not demonstrations on a working quantum computer.
The largest highlighted reduction involved a decoding circuit used in decoded quantum interferometry, an algorithmic approach to optimization. The researchers estimate the redesigned circuit needs about 440,000 Toffoli gates, compared with 5.1 million in the comparison design, while its peak qubit requirement falls from 1,938 to 1,837. Toffoli gates are costly operations in many proposed error-corrected quantum-computing designs, making their count one measure of circuit workload.
The team’s eighth result was a new arithmetic design that offers different trade-offs between gate count and qubit use, rather than reducing both measures in the same way as the other seven. The work used programming tools and an evaluator to check candidate circuits and estimate their resource needs. Anthropic’s accompanying account identifies the model as Claude Mythos 5 and says its elliptic-curve arithmetic work took 53 hours; those details are reported by Anthropic, while the broader results are presented in the research preprint.
For the decoder, the researchers replaced a design based on the extended Euclidean algorithm with one using Berlekamp–Massey. Their approach reduced the amount of intermediate information that had to be stored. The paper says a storage requirement that could reach 665 qubits in the worst case was reduced to 19 qubits in the discovered design, with a small probability of failure on rare inputs exceeding that capacity. These are design and resource estimates, not measured operating results from quantum hardware.
Lowering Costs Inside Quantum Algorithms
Quantum-computing performance depends not only on building larger, more reliable machines but also on making the circuits that run on them less demanding. If a routine uses fewer costly gates or qubits, it may take less hardware or leave more capacity for other parts of a larger calculation. That could matter for algorithms in fields such as chemistry, optimization, physics simulation and number theory, the areas represented by the study’s tasks.
The research also points to a possible role for AI systems as tools for structured design work. The model did not simply offer unverified suggestions: the team gave it programming tools and a scoring process that checked proposed circuits and returned resource estimates. Researchers say it could revise its designs using that feedback. Whether this approach can routinely produce useful improvements beyond the tested examples remains an open question.
Estimated circuit savings do not establish that a full quantum application will become faster or feasible. Practical impact depends on how the circuits fit into complete algorithms, the error rates and architecture of a machine, and the overhead of running an error-corrected computation. The reported results are a step in circuit design, not evidence of a near-term hardware breakthrough.
As an affiliate, we earn on qualifying purchases.
How the Circuit Search Worked
A quantum circuit is a sequence of operations applied to qubits, the units that hold quantum information. Larger algorithms rely on smaller routines for tasks such as arithmetic and data processing. Circuit designers must often make operations reversible: unlike ordinary software, a quantum computation cannot simply discard temporary information. Designers may need to retain intermediate results or perform additional operations to clear them, creating trade-offs between qubit use and gate count.
The researchers’ search explored ways to reconstruct information when needed, share arithmetic between computational paths, and reduce resources set aside for rare inputs where the task permits a small failure probability. The reported decoder is part of an optimization algorithm, not a routine for correcting faults in quantum hardware. The team assessed the circuits through computational checks and estimates, according to the report; the supplied material does not describe tests on a physical quantum processor.
“The model is identified as Claude Mythos 5.”
— Anthropic’s accompanying blog post
Hardware Performance Still Untested
The reported reductions are based on circuit evaluations and resource estimates; the source material does not report running the redesigned circuits on a quantum computer. It is not yet clear how the designs would perform when integrated into complete algorithms or adapted to specific hardware, where connectivity, error correction and other engineering constraints can affect resource needs.
The supplied report also does not provide the full comparative results for all eight tasks or establish that the estimated reductions translate into faster end-to-end computation. For the decoder, the design accepts a small chance of failure on rare inputs, but the excerpt does not give all conditions needed to assess that trade-off across practical workloads. Those questions require further technical evaluation.
Testing Designs Beyond Estimates
The next step is to examine how the circuits perform when incorporated into full quantum algorithms and evaluated against the constraints of actual or specified quantum hardware. Further independent review of the preprint and its methods could also clarify how the baselines were chosen and how the resource estimates compare across different implementations.
No hardware demonstration or follow-up milestone is specified in the supplied material. Until such evidence is available, the results should be read as promising circuit-design estimates rather than proof that existing quantum computers can perform these calculations with the reported savings.
Key Questions
What did Anthropic and Harvard report?
They reported using Claude to design circuits for eight quantum-computing tasks. The preprint says seven designs lowered both estimated costly-operation counts and qubit needs relative to the study’s baselines.
How much smaller was the highlighted decoder circuit?
The researchers estimate it uses about 440,000 Toffoli gates, down from 5.1 million in the comparison design. Its peak qubit requirement is estimated to fall from 1,938 to 1,837.
Were the circuits tested on a quantum computer?
The reported results came from computational checks and resource estimates. The source material does not describe a demonstration on working quantum hardware.
Does the study show that quantum computers can now solve these tasks?
No. The work reports more efficient circuit designs, but practical benefits depend on integrating them into full algorithms and running them under the constraints of quantum machines.
Source: rss
Halloween Picks
halloween
As an affiliate, we earn on qualifying purchases.
