T Count as a Numerically Solvable Minimization Problem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910223156903936 |
|---|---|
| author | Davis, Marc Grau Younis, Ed Weiden, Mathias Choi, Hyeongrak Englund, Dirk |
| author_facet | Davis, Marc Grau Younis, Ed Weiden, Mathias Choi, Hyeongrak Englund, Dirk |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_25101 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | T Count as a Numerically Solvable Minimization Problem Davis, Marc Grau Younis, Ed Weiden, Mathias Choi, Hyeongrak Englund, Dirk Quantum Physics Emerging Technologies 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. |
| title | T Count as a Numerically Solvable Minimization Problem |
| topic | Quantum Physics Emerging Technologies |
| url | https://arxiv.org/abs/2603.25101 |