TY - JOUR
T1 - Lower bounds on the complexity of simulating quantum gates
JF - Physical Review A
Y1 - 2003
A1 - Andrew M. Childs
A1 - Henry L. Haselgrove
A1 - Michael A. Nielsen
AB - 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.
VL - 68
UR - http://arxiv.org/abs/quant-ph/0307190v1
CP - 5
J1 - Phys. Rev. A
U5 - 10.1103/PhysRevA.68.052311
ER -