ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS

被引：3

作者：

Wen, Jiayan ^{[1
,2
]}

Huang, Yi ^{[1
]}

Qiu, Daowen ^{[1
,3
]}

机构：

[1] Sun Yat Sen Univ, Sch Informat Sci & Technol, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China

[2] Naval Arms Command Acad, Guangzhou 510431, Guangdong, Peoples R China

[3] Univ Tecn Lisboa, IST, Inst Telecommun, SQIC, P-1049001 Lisbon, Portugal

来源：

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION | 2009年 / 7卷 / 08期

基金：

中国国家自然科学基金;

关键词：

Quantum entanglement; adiabatic quantum computation; adiabatic quantum algorithm;

D O I：

10.1142/S0219749909006000

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, by constructing a more entangled quantum system, we shorten the adiabatic quantum search algorithm to constant time. On the other hand, we show that the speed-up of adiabatic quantum algorithms by selecting particular adiabatic evolution paths or injecting energy into the quantum system can be explained as a form of entanglement enlargement. These findings suggest that entanglement plays a fundamental role for the efficiency of algorithm performance.

引用

页码：1531 / 1539

页数：9

共 25 条

[1] Adiabatic quantum computation is equivalent to standard quantum computation
Aharonov, Dorit
Van Dam, Wim
Kempe, Julia
Landau, Zeph
Lloyd, Seth
Regev, Oded
[J]. SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 166 - 194
[2] [Anonymous], 2000, QUANTUM PHYS
[3] Cohen-Tannoudji C., 1977, Quantum Mechanics, V2
[4] Energy and efficiency of adiabatic quantum search algorithms
Das, S
Kobes, R
Kunstatter, G
[J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2003, 36 (11): : 2839 - 2845
[5] EKERT A, QUANTPH9803072
[6] ERYIGIT R, QUANTPH0309201V4
[7] A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Farhi, E
Goldstone, J
Gutmann, S
Lapan, J
Lundgren, A
Preda, D
[J]. SCIENCE, 2001, 292 (5516) : 472 - 476
[8] FARHI E, QUANTPH0512159
[9] FARHI E, QUANTPH0208135
[10] GAITAN F, QUANTPH07072420

← 1 2 3 →