Adiabatic quantum computation and Deutsch's algorithm

被引：43

作者：

Das, S

Kobes, R

Kunstatter, G

机构：

[1] Univ Winnipeg, Dept Phys, Winnipeg, MB R3B 2E9, Canada

[2] Winnipeg Inst Theoret Phys, Winnipeg, MB R3B 2E9, Canada

来源：

PHYSICAL REVIEW A | 2002年 / 65卷 / 06期

关键词：

D O I：

10.1103/PhysRevA.65.062310

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

We show that by a suitable choice of a time-dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.

引用

页数：4

共 15 条

[1]

Bransden B. H., 1989, INTRO QUANTUM MECH

[2]

CHILDS AM, QUANTPH0108048

[3]

CHILDS AM, QUANTPH0012104

[4]

Cleve R, 1998, P ROY SOC A-MATH PHY, V454, P339, DOI 10.1002/(SICI)1099-0526(199809/10)4:1<33::AID-CPLX10>3.0.CO

[5]

2-U

[6] RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION [J].

DEUTSCH, D ;

JOZSA, R .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907) :553-558

[7] 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

[8]

EKERT A, QUANTPH0011013

[9]

FARHI E, QUANTPH9612026

[10]

FARHI E, QUANTPH0104129

← 1 2 →