T Count as a Numerically Solvable Minimization Problem

Quantum Physics [Submitted on 26 Mar 2026] T Count as a Numerically Solvable Minimization Problem Marc Grau Davis, Ed Younis, Mathias Weiden, Hyeongrak Choi, Dirk Englund We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically solvable in practice. We reproduce best-known results for synthesis of circuits with a small number of qubits, and push the bounds of the largest circuits that can be solved for in this way. Additionally, we show that circuit partitioning can be used to adapt this technique to be used to optimize the T -Count of circuits with large numbers of qubits by breaking the circuit into a series of smaller sub-circuits that can be optimized independently. Comments: 6 pages 4 figures and tables Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET) Cite as: arXiv:2603.25101 [quant-ph]   (or arXiv:2603.25101v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.25101 Focus to learn more Submission history From: Marc Davis [view email] [v1] Thu, 26 Mar 2026 07:15:52 UTC (105 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 Change to browse by: cs cs.ET References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)