Xiling Xue

  • Citations Per Year
Learn More
We use bit operation to construct the novel and perfect Hash function and present an efficient algorithm which can construct optimal quantum reversible logic circuits with various types of gates by using the Hash table and produce quantum circuits with minimal cost in theory. Judging by the internationally recognized reversible functions of three variables,(More)
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(More)
  • 1