AG-CoT：Clifford电路上LLM程序合成的验证算法轨迹
AG-CoT: Verified Algorithmic Traces for LLM Program Synthesis on Clifford Circuits
浏览论文内容
中文总结 AI 辅助
针对科学代码生成中程序可能计算错误的问题，提出AG-CoT方法，用验证器检查的算法轨迹监督LLM合成Clifford电路，显著提升状态等价准确率，并证明精确验证的必要性。
中文摘要 AI 辅助
科学代码生成可能产生可执行程序，但这些程序无法计算预期的科学对象。我们研究了在Clifford电路的语言模型合成中的这一问题，Clifford电路用于制备量子纠错中使用的稳定子态，并允许精确的经典验证。在我们的目标条件框架中，每个目标以紧凑的有符号稳定子生成器给出，精确验证器检查生成的OpenQASM电路。我们用Aaronson-Gottesman思维链（AG-CoT）轨迹监督模型，这些轨迹由验证器检查，并继续在验证器接受的模型生成上进行训练。在两个独立训练的模型家族（3B和7B）中，AG-CoT监督将贪心解码的状态等价准确率比仅电路基线提高了四到六倍，验证器过滤的继续训练在两者之上进一步带来一致的增益。一项补充的32B研究表明，受监督的模型实现了近乎完美的语法和Clifford有效性，而最强的直接模型每个目标达到6.14%的状态等价率，在验证器引导的多候选选择下升至10%以上。这些结果表明，算法轨迹监督在两个模型家族中带来了显著且统计上显著的增益，验证器过滤的继续训练进一步带来重复增益。Clifford有效性与状态等价之间的持续差距证实了精确验证的必要性：电路可能在语法和物理上有效，却制备了错误的量子态。
英文摘要
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 supervision multiplies greedy-decode state-equivalence accuracy by four to six times over circuit-only baselines, and verifier-filtered continuation training adds a further consistent gain atop both. A complementary 32B study shows that supervised models achieve near-perfect syntax and Clifford validity while the strongest direct model reaches 6.14% state equivalence per target, rising to over 10% under verifier-guided selection with multiple candidates. These results show that algorithmic trace supervision gives a large, statistically significant gain in both model families and that verifier-filtered continuation adds a further repeated gain. The persistent gap between Clifford validity and state equivalence confirms that exact verification is necessary: a circuit can be syntactically and physically valid yet prepare the wrong quantum state.
