Classical simulation of Grovers quantum algorithm

Abstract This paper in a didactic way, presents an introduction to quantum computing where some quantum formalisms are analyzed to finally address Grover's algorithm. It is widely known that this algorithm is one of the key algorithms in quantum computing, being its ability to explode successfully the superposition principle one of the reasons. In addition, this algorithm can be used for both locating efficiently a specific element in a cluttered database and solving certain problems when it is difficult finding a proper solution, but at the same time it is very simple to try with possible candidates. Finally, a simulation of this algorithm is carried out and the results are compared with other classical algorithms to illustrate the significant potential advantages of quantum computing.

摘要 本文以教学科普的形式介绍量子计算相关内容，先对若干量子形式体系展开分析，最终聚焦格罗弗（Grover）算法。众所周知，该算法是量子计算领域的核心算法之一，其能够有效运用叠加原理的特性正是其关键优势之一。此外，该算法既可高效地在杂乱无章的数据库中定位特定元素，也可用于解决部分难以直接找到合适解，但却便于逐一枚举候选方案的问题。最后，本文对该算法开展仿真实验，并将实验结果与经典算法进行对比，以直观展现量子计算所具备的显著潜在优势。