Practical scheme for quantum computation with any two-qubit entangling gate

被引：187

作者：

Bremner, MJ ^{[1
]}

Dawson, CM

Dodd, JL

Gilchrist, A

Harrow, AW

Mortimer, D

Nielsen, MA

Osborne, TJ

机构：

[1] Univ Queensland, Ctr Quantum Comp Technol, Brisbane, Qld 4072, Australia

[2] Univ Queensland, Dept Phys, Brisbane, Qld 4072, Australia

[3] MIT Phys, Cambridge, MA 02139 USA

来源：

PHYSICAL REVIEW LETTERS | 2002年 / 89卷 / 24期

关键词：

D O I：

10.1103/PhysRevLett.89.247902

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

引用

页数：3