Phase matching in quantum searching

被引：170

作者：

Long, GL ^{[1
]}

Li, YS ^{[1
]}

Zhang, WL ^{[1
]}

Niu, L ^{[1
]}

机构：

[1] Tsing Hua Univ, Dept Phys, Beijing 100084, Peoples R China

来源：

PHYSICS LETTERS A | 1999年 / 262卷 / 01期

关键词：

quantum searching; phase matching; quantum computing;

D O I：

10.1016/S0375-9601(99)00631-3

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

When arbitrary phase rotations are used instead of inversions in Grover's quantum algorithm, they must satisfy a matching condition. When phase matching is satisfied, the quantum search is an approximate rotation in 2-dimensional space. An approximate formula for the amplitude is derived. A simple explanation is also given. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

引用

页码：27 / 34

页数：8

共 22 条

[1] BIRON D, LANLEPRINTQUANTPH980
[2] Boyer M, 1998, FORTSCHR PHYS, V46, P493, DOI 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO
[3] 2-P
[4] Quantum computing - Searching a quantum phone book
Brassard, G
[J]. SCIENCE, 1997, 275 (5300) : 627 - 628
[5] BRASSARD G, LANLEPRINTQUANTPH980
[6] Experimental realization of a quantum algorithm
Chuang, IL
Vandersypen, LMK
Zhou, XL
Leung, DW
Lloyd, S
[J]. NATURE, 1998, 393 (6681) : 143 - 146
[7] Experimental implementation of fast quantum searching
Chuang, IL
Gershenfeld, N
Kubinec, M
[J]. PHYSICAL REVIEW LETTERS, 1998, 80 (15) : 3408 - 3411
[8] FU LP, IN PRESS CHIN PHYS L
[9] GINGRICH R, LANALEPRINTQUANTPH99
[10] Quantum computers can search rapidly by using almost any transformation
Grover, LK
[J]. PHYSICAL REVIEW LETTERS, 1998, 80 (19) : 4329 - 4332

← 1 2 3 →