114 citations · 115 across the 2 of their papers we have counts for
2 papers
quant-ph2014★ 1 cited
Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis
Jonathan Welch, Alex Bocharov, Krysta M. Svore
We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+ basis, that minimize the number of ph…
quant-ph2013★ 114 cited
Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
Jonathan Welch, Daniel Greenbaum, Sarah Mostame +1
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Ef…