Lower bounds on the complexity of simulating quantum gates

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. We also note that a related lower bound holds for
arbitrary n-qubit gates.