摘要:
量子计算与经典计算相比 ,能够极大地提高运算速度 ,解决一些经典计算不能解决或很难解决的问题 .对于在无序数据库中进行搜索这类问题 ,可以用量子算法 ,如Br櫣ｓｃｈｗｅｉｌｅｒ量子搜索算法来解决 .与经典算法相比 ,Br櫣ｓｃｈｗｅｉｌｅｒ量子算法能够指数次地提高搜索速度 .在Br櫣ｓｃｈｗｅｉｌｅｒ提出的算法中 ,数据量子位和观测量子位 (辅助量子位 )是分开的 ,属于不同的量子位 .通过研究 ,对Br櫣ｓｃｈｗｅｉｌｅｒ算法作了改进 ,使之不需要用辅助量子位 ,就可以达到指数次提高搜索速度的目的 .改进后的Br櫣ｓｃｈｗｅｉｌｅｒ量子算法有利于简化实验的设计和实现过程 .同时还利用核磁共振实验 ,演示了改进后的Br櫣ｓｃｈｗｅｉｌｅｒ量子算法的实现. In recent years, quantum computing research has made big progress, which exploit quantum mechanical laws, such as interference, superposition and parallelism, to perform computing tasks. The most inducing thing is that the quantum computing can provide large rise to the speedup in quantum algorithm. Quantum computing can solve some problems, which are impossible or difficult for the classical computing. The problem of searching for a specific item in an unsorted database can be...
Abstract:
In recent years, quantum computing research has made big progress, which exploit quantum mechanical laws, such as interference, superposition and parallelism, to perform computing tasks. The most inducing thing is that the quantum computing can provide large rise to the speedup in quantum algorithm. Quantum computing can solve some problems, which are impossible or difficult for the classical computing. The problem of searching for a specific item in an unsorted database can be...
点击查看大图
下载:
甘公网安备 62010202000723号