Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of...

Decomposing unitaries into a sequence of elementary operations is at the core of quantum computing. Information theoretic arguments show that approximating a random unitary with precision ε requires Ω(log(1/ε)) gates. Prior to our work, the state of the art in approximating a single qubit unitary included the Solovay-Kitaev algorithm that requires O(log(3+δ)(1/ε)) gates and does not use ancillae and the phase kickback approach that requires O(log(2)(1/ε)loglog(1/ε)) gates but uses O(log(2)(1/ε)) ancillae. Both algorithms feature upper bounds that are far from the information theoretic lower bound. In this Letter, we report an algorithm that saturates the lower bound, and as such it guarantees asymptotic optimality. In particular, we present an algorithm for building a circuit that approximates single qubit unitaries with precision ε using O(log(1/ε)) Clifford and T gates and employing up to two ancillary qubits. We connect the unitary approximation problem to the problem of constructing solutions corresponding to Lagrange's four-square theorem, and thereby develop an algorithm for computing an approximating circuit using an average of O(log(2)(1/ε)loglog(1/ε)) operations with integers.