Lower bounds on the complexity of simulating quantum gates

被引：32

作者：

Childs, AM ^{[1
]}

Haselgrove, HL

Nielsen, MA

机构：

[1] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA

[2] Univ Queensland, Sch Phys Sci, Brisbane, Qld 4072, Australia

[3] Def Sci & Technol Org, Informat Sci Lab, Edinburgh 5111, Midlothian, Scotland

[4] Univ Queensland, Sch Informat Technol & Elect Engn, Brisbane, Qld 4072, Australia

[5] CALTECH, Inst Quantum Informat, Pasadena, CA 91125 USA

[6] Univ Queensland, Ctr Quantum Comp Technol, St Lucia, Qld 4067, Australia

来源：

PHYSICAL REVIEW A | 2003年 / 68卷 / 05期

关键词：

D O I：

10.1103/PhysRevA.68.052311

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

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

共 27 条

[1]

Alberti P. M., 1982, Stochasticity and Partial Order

[2]

[Anonymous], 1996, Matrix Analysis

[3] Optimal simulation of two-qubit Hamiltonians using general local operations [J].