Quantum Circuit Pre-Synthesis: Learning Local Edits to Reduce T-count
Not on the map. Why?
Abstract (arXiv)
Compiling quantum circuits into Clifford+T gates is a central task for fault-tolerant quantum computing using stabilizer codes. In the near term, T gates will dominate the cost of fault tolerant implementations, and any reduction in the number of such expensive gates could mean the difference between being able to run a circuit or not. While exact synthesis is exponentially hard in the number of qubits, local synthesis approaches are commonly used to compile large circuits by decomposing them into substructures. However, composing local methods leads to suboptimal compilations in key metrics such as T-count or circuit depth, and their performance strongly depends on circuit representation. In this work, we address this challenge by proposing textscQ-PreSyn, a strategy that, given a set of local edits preserving circuit equivalence, uses a RL agent to identify effective sequences of such actions and thereby obtain circuit representations that yield a reduced T-count upon synthesis. Experimental results of our proposed strategy, applied on top of well-known synthesis algorithms, show up to a 20% reduction in T-count on circuits with up to 25 qubits, without introducing any additional approximation error prior to synthesis.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 69 references that are in the map. First posted on arXiv 27 Jan 2026.
Builds on
14 of 69 references.
References · 14
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
- 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 734
- 2020Curriculum Learning for Reinforcement Learning Domains: A Framework and Surveycited by 373
- 2021Generalization in quantum machine learning from few training datacited by 216
- 2021Reinforcement learning for optimization of variational quantum circuit architecturescited by 77
- 2022Out-of-distribution generalization for learning quantum dynamicscited by 49
- 2024Quantum Circuit Optimization with AlphaTensorcited by 36
- 2019A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolvercited by 20
- 2021A semi-agnostic ansatz with variable structure for quantum machine learningcited by 15
- 2022Compiler Optimization for Quantum Computing Using Reinforcement Learningcited by 11
- 2023Quarl: A Learning-Based Quantum Circuit Optimizercited by 10
- 2025Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learningcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.