Share Email Print
cover

Proceedings Paper

Quantum search simulation with Wolfram Mathematica
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We consider Grover's algorithm of quantum search for one or several integers out of N = 2n, where n is a number of quantum bits in the memory register. There is a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which ones out of N they are. 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. We have analyzed the Grover algorithm carefully and showed that it enables to speed up this search quadratically, although its realization requires to know a number of hidden items. The lower bound for the probability of successful solving the search problem has been obtained. The validity of the results was demonstrated by simulation of the Grover search algorithm using the package QuantumCircuit written in the Wolfram Mathematica language.

Paper Details

Date Published: 28 September 2016
PDF: 8 pages
Proc. SPIE 10031, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016, 100314H (28 September 2016); doi: 10.1117/12.2248907
Show Author Affiliations
Alexander N. Prokopenya, Warsaw Univ. of Life Sciences (Poland)


Published in SPIE Proceedings Vol. 10031:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2016
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top