Lower bounds on the complexity of simulating quantum gates

Creators: Childs, Andrew; Haselgrove, Henry; Nielsen, Michael

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.

Additional Information

© 2003 American Physical Society. (Received 4 August 2003; published 18 November 2003) We thank Aram Harrow and Tobias Osborne for helpful discussions, and Andrew Doherty for an informative seminar on related problems. A.M.C. received support from the Fannie and John Hertz Foundation, and thanks the University of Queensland node of the Center for Quantum Computer Technology for its hospitality. A.M.C. was also supported in part by the Cambridge-MIT Institute, by the Department of Energy under cooperative research agreement No. DE-FC02-94ER40818, and by the National Security Agency and Advanced Research and Development Activity under Army Research Office Contract No. DAAD19-01-1-0656. Finally, we acknowledge the hospitality of the Caltech Institute for Quantum Information, where this work was completed. This work was supported in part by the National Science Foundation under Grant No. EIA-0086038.

Attached Files

Published - PhysRevA.68.052311.pdf

Submitted - 0307190.pdf

Files

PhysRevA.68.052311.pdf

Files (269.3 kB)

Name	Size	Download all
PhysRevA.68.052311.pdf md5:191ad969e8f3eb9df133e9d4aa74a8c5	69.8 kB	Preview Download
0307190.pdf md5:9fba232632bf3a8d413a174bd8c25dc2	199.5 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes