论文标题
快速模拟Grover在古典计算机上的量子搜索
Fast simulation of Grover's quantum search on classical computer
论文作者
论文摘要
研究界一直在积极研究量子计算机的实现。但是，随着算法的出现及其在多个域中的应用大道，大规模的商业量子计算机并不是现实，但量子计算场变得更加丰富。有效的量子模拟器的可用性将使研究人员能够快速验证其结果和概念，以建立正确的正确性证明。 Grover的搜索算法是，它已成为构建其他算法和模型的基本要素之一，它已知是最密集的算法。我们的方法突出了可以快速模拟Grover搜索的设计原理，该搜索可以在通用个人计算机上实现。与现有模拟器相比，获得的性能令人鼓舞。
The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms and the avenue of its application in multiple domains. Availability of efficient quantum simulators will enable the researchers to quickly verify their results and concepts in order to establish a working proof of correctness. One important algorithm that has become one of the basic ingredients to build other algorithms and models is the Grover's search Algorithm which is known to be the most compute intensive. Our approach highlights the design principles for the fast simulation of Grover's search which can be implemented on a general purpose personal computer. The performance obtained are encouraging when compared to the existing simulators.
