10 citations · 17 across the 2 of their papers we have counts for
3 papers · 1 filter
The Solovay-Kitaev algorithm
Christopher M. Dawson, Michael A. Nielsen
This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequenc…
Quantum computing and polynomial equations over the finite field Z_2
Christopher M. Dawson, Henry L. Haselgrove, Andrew P. Hines +3
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily c…
Universal simulation of Hamiltonian dynamics for qudits
Michael A. Nielsen, Michael J. Bremner, Jennifer L. Dodd +2
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in…