Reducing quantum computations to elementary unitary operations

被引：56

作者：

Cybenko, G ^{[1
]}

机构：

[1] Dartmouth Coll, Hanover, NH 03755 USA

来源：

COMPUTING IN SCIENCE & ENGINEERING | 2001年 / 3卷 / 02期

关键词：

D O I：

10.1109/5992.908999

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Quantum computations are intimately connected with unitary operators. This article shows that standard techniques from numerical linear algebra can be used to represent quantum computations as sequences of simple quantum operations, called quantum Givens operators, on single quantum bits.

引用

页码：27 / 32

页数：6

共 7 条

[1] ELEMENTARY GATES FOR QUANTUM COMPUTATION [J].

BARENCO, A ;

BENNETT, CH ;

CLEVE, R ;

DIVINCENZO, DP ;

MARGOLUS, N ;

SHOR, P ;

SLEATOR, T ;

SMOLIN, JA ;

WEINFURTER, H .

PHYSICAL REVIEW A, 1995, 52 (05) :3457-3467

[2] UNIVERSALITY IN QUANTUM COMPUTATION [J].

DEUTSCH, D ;

BARENCO, A ;

EKERT, A .

PROCEEDINGS OF THE ROYAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1995, 449 (1937) :669-677

[3]

Golub G.H., 2013, MATRIX COMPUTATIONS

[4]

KATZ RH, 1993, CONT LOGIC DESIGN

[5] REVERSIBLE LOGIC AND QUANTUM COMPUTERS [J].

PERES, A .

PHYSICAL REVIEW A, 1985, 32 (06) :3266-3276

[6]

VITANYI PMB, 1995, LECT NOTES COMPUTER, V969, P106

[7]

Williams C. P., 1998, Explorations in quantum computing

← 1 →