1k citations · 1.7k across the 17 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
quant-ph2013★ 112 cited
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…
quant-ph2013★ 72 cited
Efficient Decomposition of Single-Qubit Gates into Basis Circuits
Alex Bocharov, Yuri Gurevich, Krysta M. Svore
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal basis. The basis is an alternative universal basis to…