From Schrodinger's equation to the quantum search algorithm

被引:114
作者
Grover, LK [1 ]
机构
[1] Bell Labs, Phys Res, Murray Hill, NJ 07974 USA
关键词
D O I
10.1119/1.1359518
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
The quantum search algorithm is a technique for searching N possibilities in only O(rootN) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it; these are quite different from any of the generally known forms of the algorithm, This paper describes these steps, which start by discretizing Schrodinger's equation. This paper also provides a self-contained introduction to quantum computing algorithms from a new perspective. O zool American Association of Physics Teachers.
引用
收藏
页码:769 / 777
页数:9
相关论文
共 7 条
[1]  
[Anonymous], SEARCHING GROVERS AL
[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 mechanics helps in searching for a needle in a haystack [J].
Grover, LK .
PHYSICAL REVIEW LETTERS, 1997, 79 (02) :325-328
[5]   Grover's quantum searching algorithm is optimal [J].
Zalka, C .
PHYSICAL REVIEW A, 1999, 60 (04) :2746-2751
[6]  
2000, WINT I FDN QUANT THE
[7]  
1996, P 28 ANN ACM S THEOR, P212