Sign inGet started
Paper · arXiv

AG-CoT: Verified Algorithmic Traces for LLM Program Synthesis on Clifford Circuits

Scientific code generation can produce executable programs that fail to compute the intended scientific object. We study this problem in language-model synthesis of Clifford circuits, which prepare the stabilizer states used in quantum error correction and admit exact classical verification. In our target-conditioned framework, each target is given as compact signed stabilizer generators, and an exact verifier checks the generated OpenQASM circuits. We supervise models with Aaronson-Gottesman chain-of-thought (AG-CoT) traces checked by the verifier, and continue training on model generations that the verifier accepts. Across two independently trained model families (3B and 7B), AG-CoT sup...

AuthorsLu Wei, Yufeng Wang, Chenfeng Cao et al.
Primary categorycs.LG
Published27 September 2026
Last updated at source27 September 2026
cs.LGcs.CLquant-ph
Embed this entry
<iframe src="https://silytics.si/embed/item/d3b0ce22-426a-4bb7-8587-249bf077f27f" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.