144 citations · 275 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2014★ 59 cited
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of gates of about of what is requ…
quant-ph2014★ 144 cited
Efficient synthesis of universal Repeat-Until-Success circuits
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a times reduction in expected -count over ancilla-free techniques for single-qubit unitary deco…
quant-ph2012★ 72 cited
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
Alex Bocharov, Krysta M. Svore
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations…