Lower bounds on the complexity of simulating quantum gates
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0307190,
title = {Lower bounds on the complexity of simulating quantum gates},
author = {Andrew M. Childs and Henry L. Haselgrove and Michael A. Nielsen},
journal= {arXiv preprint arXiv:quant-ph/0307190},
year = {2007}
}
备注
6 pages