论文标题
量子算法简要介绍
A brief introduction to quantum algorithms
论文作者
论文摘要
证明量子算法的表现要优于某些问题的经典算法，因此是有希望的候选人进行有效的信息处理。在此，我们旨在为学术界和公众提供简短而流行的量子算法介绍。我们从阐明量子并行性，量子算法的基本框架和量子算法设计的难度开始。然后，我们主要关注过去三到四十年中量子算法研究进展的历史概述。最后，我们阐明了有关量子算法研究的两个常见问题，希望刺激读者进行进一步的探索。
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum algorithms for both the academic community and the general public with interest. We start from elucidating quantum parallelism, the basic framework of quantum algorithms and the difficulty of quantum algorithm design. Then we mainly focus on a historical overview of progress in quantum algorithm research over the past three to four decades. Finally, we clarify two common questions about the study of quantum algorithms, hoping to stimulate readers for further exploration.
