LLM-Guided Evolutionary Search for Algebraic T-Count Optimization

Abstract:T-count minimization is an NP-hard problem that arises in fault-tolerant quantum compilation. In the parity-matrix representation, which captures the non-Clifford part of a quantum circuit, algebraic optimizers such as TODD can achieve state-of-the-art results. However, heuristics fixed in advance determine which transformation is applied, limiting the exploration of alternative trajectories that may lead to better solutions. We show how LLM-guided evolutionary search can help explore these degrees of freedom, which VarTODD exposes through a policy that determines how to allocate the available evaluation budget and how to guide the search. Execution diagnostics guide LLM-generated revisions to both numerical search parameters and program logic, with the possibility of exploiting earlier results by starting from intermediate matrices saved during previous runs. This formulation turns heuristic design into an automated search problem and, across all evaluated instances, matches or improves on the lowest listed reference T-count for every evaluated instance; for example, on the GF(2^n) multiplier benchmarks, it yields a mean relative reduction of 7.0%.

arXiv:2603.29894 [quant-ph]

(or arXiv:2603.29894v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2603.29894 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.