Fig. 4: Demonstration of Grover’s search algorithm with multiple amplification cycles.
From: Scalable algorithm simplification using quantum AND logic
a, Circuit diagram implementing Grover’s search algorithm. In this example, the encoded solution is 110101. Y±1/2 indicates a ±π/2 rotation about the Y axis. b, Measured output state probability distribution for each of the 2n encoded states in the 4-qubit and 6-qubit Grover’s search algorithms. c, Average algorithm success probabilities (dots) and four times the standard deviations (error bars) of all 2n cases versus the number of oracle-amplification cycles. The solid lines are fits to equation (1) with finite gate fidelity. The dashed lines correspond to the ideal case with unity fidelity.
