559 citations · 7k across the 99 of their papers we have counts for
4 papers · 2 filters
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
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 qu…
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates. Ou…
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring $\mathbb{Z}[\frac{1…
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca +1
We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speed-up over simple br…