# Quantum Circuit Implementing Grover's Search Algorithm

Quantum Circuit Implementing Grover's Search Algorithm

The search problem is formulated as follows: some -bit integer is hidden in a black-boxed subroutine that indicates, when presented with any -bit integer , whether or not coincides with , returning this information as the value of the -bit binary function. The function is implemented by the quantum circuit bounded by two dashed lines in the diagram. The problem is to find in a minimum number of applications of the subroutine.

n

k

n

x

x

k

n

k

This Demonstration shows a quantum circuit implementing Grover's search algorithm that enables finding any given integer from the list , where , with a probability that is very close to 1, repeating Grover's iterations times, where is the integer part of the number .

k

{0,1,...,N-1}

N=

n

2

m

opt

m

opt

π4arcsin1

N