On the Research of BDD Based Simulation of Grover's Algorithm

In this paper, we adopt an efficient data structure called the binary decision diagram (BDD) that exploits the structure displayed in quantum computing to simulate Grover's quantum search algorithm. First we adapt the original BDD and implement a series of algorithms to represent and manipulate matrices and vectors. Then instances of Grover's algorithm are simulated using our programme written in C++. In the last part we present an intensive analysis of the counter-intuitive experimental results in quantum mechanism, which may help understand the essence of quantum algorithms.