{"schema":"postcutoff/event@1","as_of":"2026-10-16T12:39:00+02:00","url":"https://postcutoff.com/e/2026-10-15-llm-discovered-quantum-circuits-harvard-anthropic-mythos/","md":"https://postcutoff.com/e/2026-10-15-llm-discovered-quantum-circuits-harvard-anthropic-mythos/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-15-llm-discovered-quantum-circuits-harvard-anthropic-mythos","date":"2026-10-15","date_precision":"day","short_title":"Harvard–Anthropic team (with Mikhail Lukin) uses Claude Mythos 5 in an evolutionary search to beat state-of-the-art quantum circuits on seven of eight tasks","deck":null,"takeaway":"An LLM-plus-evaluator search, starting from blank programs, cut Toffoli-times-qubit costs by 4× to 39× for quantum arithmetic subroutines and found a new reversible design for modular inversion.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":[{"n":1,"title":"arXiv 2610.22367: Discovering state-of-the-art quantum circuits with large language models","url":"https://arxiv.org/abs/2610.22367","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-16","updated":"2026-10-16","orgs":["Harvard University","Anthropic","QuEra Computing"],"title":"Harvard–Anthropic team (with Mikhail Lukin) uses Claude Mythos 5 in an evolutionary search to beat state-of-the-art quantum circuits on seven of eight tasks","summary":"arXiv 2610.22367 (15 Oct 2026) by Andi Gu, Alek Kemeny (Anthropic), Susanne Yelin and Mikhail Lukin pairs Claude Mythos 5, run inside the open-source OpenEvolve framework, with an independent evaluator that verifies and scores reversible circuits. On eight compilation tasks (decoders for decoded quantum interferometry, HHL rotations, Coulomb and Gaussian functions, chemistry and lattice-gauge simulation, modular inversion), the discovered circuits reduce both Toffoli and qubit counts versus the state of the art in seven, with Toffoli×qubit gains of 4.1× to 39×; in the eighth it found a new reversible architecture making divsteps practical for prime-field modular inversion.","key_facts":["Paper: 'Discovering state-of-the-art quantum circuits with large language models', Andi Gu (Harvard; Anthropic STEM Fellows Program), Alek H. Kemeny (Anthropic), Susanne F. Yelin (Harvard), Mikhail D. Lukin (Harvard; QuEra), arXiv 2610.22367 [quant-ph], 15 Oct 2026","Setup (quoted): 'We search over these circuit-generating programs with OpenEvolve, using Claude Mythos 5 to propose architectures and program rewrites … Starting from a blank program, it chooses the algorithm, representation, and circuit structure and produces the discovered circuits without substantive human intervention'; MAP-Elites keeps Toffoli/qubit trade-offs","Table I, Toffoli×qubit gain over baseline: Reed–Solomon DQI decoder 12× (5.1M → 440k Toffolis); HHL rotation angle 32×; Coulomb potential 9.9×; fixed-point Gaussian 39×; FeS alias–Select 4.1×; non-abelian lattice-gauge simulation 7.7×; Hermitian DQI decoder: first reversible compilation (9.3·10⁵ Toffolis vs 10⁸ naive)","Modular inversion: a new reversible architecture that makes divsteps, a classical algorithm 'previously impractical for reversible integer arithmetic', viable; separately a specialised Luo construction with 3.4× fewer Toffolis at five extra qubits","Authors' framing: 'some apparent costs of quantum arithmetic reflect limitations of existing reversible constructions rather than of the algorithms themselves'"],"key_numbers":[],"tags":["quantum-computing","circuits","algorithm-discovery","evolutionary-search","openevolve","claude-mythos-5","anthropic"],"science":null,"body_md":"## What happened\n\nQuantum algorithms often spend most of their cost on classical subroutines (arithmetic, decoding, function evaluation) that must be\nwritten as reversible circuits. Optimizers usually only apply equivalence-preserving rewrites to a fixed design.\n\nOn 15 Oct 2026 a Harvard group led by Mikhail Lukin, with an Anthropic co-author and an Anthropic STEM Fellow as first author, posted\n[arXiv 2610.22367](https://arxiv.org/abs/2610.22367). Claude Mythos 5, inside OpenEvolve, proposes whole circuit-generating programs\nfrom a task specification and a blank start; a separate evaluator checks correctness on basis states and scores Toffoli count\ntimes peak qubits. Across eight tasks from optimisation, chemistry, simulation and number theory, the search beat published\nconstructions in seven, often by an order of magnitude, for example a 12× lower cost for the Reed–Solomon decoder in decoded\nquantum interferometry. In the eighth it found a reversible design for the divstep modular-inversion algorithm.\n\nNo Hacker News thread was found on 16 Oct (Algolia); X was not searched.\n\n## Why it matters\n\nResource estimates for useful quantum algorithms depend on such subroutines; large cuts in their cost move estimates for\napplications like DQI and lattice-gauge simulation. It is also an AlphaEvolve-style result with a frontier commercial model and an\nopen-source framework, by a leading experimental quantum group.","disputed":[],"related":[{"id":"2026-10-14-ai-assisted-results-mid-october-2026","url":"https://postcutoff.com/e/2026-10-14-ai-assisted-results-mid-october-2026/","date":"2026-10-14","date_precision":"day","short_title":"Mid-October 2026: arXiv results with disclosed AI help","deck":null,"takeaway":"The 13 Oct arXiv listing alone brought a human write-up of GPT-6 Astra's rational exponents proof, Ulam's Lie group question answered with an Astra construction, a better-than-2 k-median algorithm, and about a dozen smaller results whose AI statements range from 'suggested by ChatGPT' to 'GPT 6 Pro was used … to obtain all other new results'.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":20,"official":19,"filed":"2026-10-14","updated":"2026-10-15","orgs":["OpenAI","Anthropic","various mathematicians"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-16","type":"filed","text":"Created from the arXiv PDF"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-16","run":null,"sources_read":"The arXiv PDF","updated":"2026-10-16","human_review":null,"version":{"date":"2026-10-16"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":168,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":107,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":198,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":137,"in_training_data":false}],"short_url":null}