Quantum Search Simulation with Wolfram Mathematica

We present here a Mathematica package for simulation of quantum computation based on the quantum circuit model. As an example of its application we consider Grover's algorithm of quantum search for one or several items out of N=2^n, where n is a number of quantum bits in the memory register. We have a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which one out of N it is. To find the hidden items we can do no better with a classical computer than to apply the subroutine repeatedly to all possible integers until we hit on the special one and in the worst case we have to repeat this procedure N times. Using the corresponding quantum circuit we can show that quantum computer speeds up this search considerably.

Author: Alexander Prokopenya
Conference: Title