Papers › A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-depth 1 unitaries, such that it is possible to express the T-depth-optimal decomposition of any unitary as product of unitaries from this subset and a Clifford (up to global phase). The cardinality of this subset is at most n·2^(5.6n). We use nested meet-in-the-middle (MITM) technique to develop algorithms for synthesizing provably \emph{depth-optimal} and \emph{T-depth-optimal} circuits for exactly implementable unitaries. Specifically, for synthesizing T-depth-optimal circuits, we get an algorithm with space and time complexity O((4^(n²))^(⌈d/c⌉)) and O((4^(n²))^((c-1)⌈d/c⌉)) respectively, where d is the minimum T-depth and c≥2 is a constant. This is much better than the complexity of the algorithm by Amy et al.(2013), the previous best with a complexity O((3ⁿ·2^(kn²))^(⌈d/2⌉)·2^(kn²)), where k>2.5 is a constant. We design an even more efficient algorithm for synthesizing T-depth-optimal circuits. The claimed efficiency and optimality depends on some conjectures, which have been inspired from the work of Mosca and Mukhopadhyay (2020). To the best of our knowledge, the conjectures are not related to the previous work. Our algorithm has space and time complexity poly(n,2^(5.6n),d) (or poly(nˡᵒᵍⁿ,2^(5.6n),d) under some weaker assumptions).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections