Optimal ancilla-free Clifford+T approximation of z-rotations (pp0901-0953)
          Neil J. Ross and Peter Selinger
          doi: https://doi.org/10.26421/QIC16.11-12-1
Abstracts: We consider the problem of approximating arbitrary single-qubit z-rotations by ancillafree Clifford+T circuits, up to given epsilon. We present a fast new probabilistic algorithm for solving this problem optimally, i.e., for finding the shortest possible circuit whatsoever for the given problem instance. The algorithm requires a factoring oracle (such as a quantum computer). Even in the absence of a factoring oracle, the algorithm is still near-optimal under a mild number-theoretic hypothesis. In this case, the algorithm finds a solution of T-count m + O(log(log(1/ε))), where m is the T-count of the second-to-optimal solution. In the typical case, this yields circuit approximations of Tcount 3 log2 (1/ε) + O(log(log(1/ε))). Our algorithm is efficient in practice, and provably efficient under the above-mentioned number-theoretic hypothesis, in the sense that its expected runtime is O(polylog(1/ε)).
Key words: circuit synthesis, Clifford+T, optimal approximation of unitary operators