Robustness of the quantum search algorithm
作者:
B. Pablo-Norman,
M. Ruiz-Altaba,
期刊:
AIP Conference Proceedings
(AIP Available online 1999)
卷期:
Volume 490,
issue 1
页码: 405-408
ISSN:0094-243X
年代: 1999
DOI:10.1063/1.1301410
出版商: AIP
数据来源: AIP
摘要:
We find exact results for Grover’s quantum search algorithm and analyze its behavior under noisy situations when no quantum correction codes are available. We compute how the algorithm slows down: it is still better than a classical one, provided the noise is smaller than some bound, which we also compute. ©1999 American Institute of Physics.
点击下载:
PDF
(169KB)
返 回