LLM-Guided Evolutionary Search for Algebraic T-Count Optimization

Daniil Fisher, Valentin Khrulkov, Mikhail Saygin +2

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…