quant-phNov 13, 2026

Agentic AI for Discovering Fault-Tolerant Quantum Circuits

Authors: Aritra Lahiri, Florian Marquardt

Organizations: Max Planck Institute for the Science of Light, 91058 Erlangen, Germany · Department of Physics, Friedrich-Alexander University Erlangen-Nürnberg, 91058 Erlangen, Germany

Abstract

Scaling quantum computing toward practical quantum advantage is currently limited by the efficiency of circuits that operate on information encoded by quantum error-correcting codes. The full stack of quantum computing encompasses several tasks: preparation of logical code states, implementation of logical gates, logical routines on encoded qubits, etc. Yet, these circuits are largely designed by hand for individual cases, with some recent works incorporating machine learning for certain aspects. We formulate this problem as agentic evolutionary program synthesis, wherein a large language model, leveraging its pretraining knowledge and tool-use proficiency, and guided by a circuit verifier, evolves a program that defines a Clifford circuit for a wide range of curated tasks such as logical state preparation, logical gate design, and logical routines such as code-switching, code growth, etc. Our approach consistently finds fault-tolerant circuits for all of these tasks, each verified by an exhaustive check over faults.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Discovering formally verified quantum programs with AI

    Nov 6, 2026Sergey Shirobokov, Ben Jaderberg, Katerina Hristova +22Automated Algorithm DiscoveryProgram Synthesis

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

    Sep 27, 2026Lu Wei, Yufeng Wang, Chenfeng Cao +2CoT SupervisionLLM-Based Program Synthesis