Lower bounds on the complexity of simulating quantum gates
arXiv:quant-ph/0307190 · doi:10.1103/PhysRevA.68.052311
Abstract
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.
6 pages