BWhat is claimed?
Used an evolutionary program-search loop with Claude-generated circuit architectures and feedback from a separate programmatic evaluator to improve reversible computational primitives, including Reed–Solomon decoding and prime-field modular inversion. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.
Scientific scope
The evaluator checks phase, preserved inputs and clean ancillas, but samples large input domains. Some designs permit distribution-specific failures, and Toffoli–qubit product is a logical-resource proxy rather than measured hardware runtime. Results do not establish arbitrary-circuit optimality or worst-case exactness.
Evidence state
The source reports this result. WRS has not independently reconstructed the complete argument or validated the reported evidence. The grade and score here express conditional significance; they do not certify correctness. The provisional value enters the main reference rankings with an unverified label, but not achieved-science progress totals.
- Discovering state-of-the-art quantum circuits with large language models
- Designing more efficient quantum circuits with Claude
Full scientific record · Challenge or correct this assessment