基于BDD的Grover算法仿真  

BDD based simulation of Grover's algorithm

作　　者：薛希玲[1] 陈汉武[1] 陈开中[1] 李志强[1,2] 

机构地区：[1]东南大学计算机科学与工程学院,南京210096 [2]扬州大学信息工程学院,扬州225009

出　　处：《东南大学学报（自然科学版）》2009年第1期28-33,共6页Journal of Southeast University：Natural Science Edition

基　　金：国家自然科学基金资助项目(60572071,60873101);江苏省自然科学基金资助项目(BK2005053,BM2006504,BK2007104,BK2008209);江苏省高校自然科学基金资助项目(06KJB520137)

摘　　要：为了解决仿真量子计算过程中复杂性随量子比特数的增加呈指数级递增的问题,采用二项决策图(BDD)表示矩阵算子仿真Grover提出的量子搜索算法.BDD利用矩阵算子在量子计算过程中呈现出的结构化特性,可以高效地压缩存储空间并实现在压缩数据结构上直接进行矩阵的各种运算.利用改进的BDD实现了仿真过程需要的各种矩阵运算,用C++编写的程序对Grover算法的实例进行仿真,最后从多个角度对违反直观的实验结果进行了分析,阐述了量子算法的内在并行性.Simulating quantum algorithms on classical computer is difficult,for the matrices representing quantum gates and the vectors modeling qubit states grow exponentially with the increase in the number of qubits.In this paper,binary decision diagram（BDD）,which exploits the structure displayed in quantum computing,is adopted to simulate Grover＇s algorithm.First the original BDD is adapted to implement a series of algorithms such as matrix multiplication to represent and manipulate matrices and vectors.Then instances of Grover＇s algorithm are simulated with our programme written in C＋＋.Finally an intensive analysis of the counter-intuitive experimental results in quantum mechanism is presented from multiple points of view,which may help understand the inner parallelism of quantum algorithms.

关 键 词：量子算法 Grover算法仿真 二项决策图 Grover迭代 

分 类 号：TP387[自动化与计算机技术—计算机系统结构]