高级检索
龙桂鲁. 量子计算算法介绍[J]. 物理, 2010, 39(12): 803-809.
引用本文: 龙桂鲁. 量子计算算法介绍[J]. 物理, 2010, 39(12): 803-809.
Introduction to quantum algorithms[J]. PHYSICS, 2010, 39(12): 803-809.
Citation: Introduction to quantum algorithms[J]. PHYSICS, 2010, 39(12): 803-809.

量子计算算法介绍

Introduction to quantum algorithms

  • 摘要: 量子计算机利用量子力学原理进行计算,具有量子并行计算的优势,能够超越经典计算1990年中期,量子算法取得突破,舒尔(Shor)构造了大数质因子的量子算法,葛洛沃(Grover)构造了无序数据库的量子搜索算法,引起了人们对量子计算的重视,极大地推动了量子计算的研究.文章简单介绍了几个典型的量子算法以及量子算法研究的一些新进展.

     

    Abstract: Quantum information is an interdisciplinary science involving quantum mechanics, information theory, and computer science. It is of strategic importance and has far-reaching influence. Born in the late 1970s, it has developed very fast since the mid-1990s. Quantum information science includes quantum computing, quantum communication, and so on. The combination of different branches of science has led to many new research topics in science and technology, and many remarkable achievements have been made. This paper will introduce the basics of quantum information science, including some very important quantum algorithms such as Shor’s algorithm and Grover’s algorithm. The former factorizes an integer in polynomial steps, while the latter finds a marked item with a square-root increase in speed compared to classical algorithms. Other recent studies of quantum algorithms will also be reviewed.

     

/

返回文章
返回