37 citations · 44 across the 2 of their papers we have counts for
2 papers
quant-ph2004★ 7 cited
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…
quant-ph2003★ 37 cited
Lower bounds on the complexity of simulating quantum gates
Andrew M. Childs, Henry L. Haselgrove, Michael A. Nielsen
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries.…