RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION

被引：1638

作者：

DEUTSCH, D ^{[1
]}

JOZSA, R ^{[1
]}

机构：

[1] ST EDMUND HALL,OXFORD OX1 4AR,ENGLAND

来源：

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES | 1992年 / 439卷 / 1907期

关键词：

D O I：

10.1098/rspa.1992.0167

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in exponentially less time than any classical deterministic computation.

引用

页码：553 / 558

页数：6

共 4 条

[1] QUANTUM-THEORY, THE CHURCH-TURING PRINCIPLE AND THE UNIVERSAL QUANTUM COMPUTER [J].

DEUTSCH, D .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1985, 400 (1818) :97-117

[2]

DEUTSCH D, 1986, QUANTUM CONCEPTS SPA

[3]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[4] CHARACTERIZING CLASSES OF FUNCTIONS COMPUTABLE BY QUANTUM PARALLELISM [J].

JOZSA, R .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1991, 435 (1895) :563-574

← 1 →