231 citations · 1.2k across the 34 of their papers we have counts for
5 papers · 1 filter
Asymptotically Optimal Topological Quantum Compiling
Vadym Kliuchnikov, Alex Bocharov, Krysta M. Svore
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling s…
An algorithm for the T-count
David Gosset, Vadym Kliuchnikov, Michele Mosca +1
We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically…
Synthesis of unitaries with Clifford+T circuits
Vadym Kliuchnikov
We describe a new method for approximating an arbitrary qubit unitary with precision using a Clifford and T circuit with gates.…
Floating Point Representations in Quantum Circuit Synthesis
Nathan Wiebe, Vadym Kliuchnikov
We provide a non-deterministic quantum protocol that approximates the single qubit rotations R_x(2a^2 b^2)$ using R_x(2a) and R_x(2b) and a constant number of Clifford and T operat…
Optimization of Clifford Circuits
Vadym Kliuchnikov, Dmitri Maslov
We study optimal synthesis of Clifford circuits, and apply the results to peep-hole optimization of quantum circuits. We report optimal circuits for all Clifford operations with up…