Quantum Amplitude Amplification

Section II: Grover's Algorithm

Back to Survey

Grover’s Algorithm

Rotating through quantum space to amplify the correct answer. Click the arrows to step through the mathematical and geometric intuition.

What is Superposition?

In classical computing, a bit is either 0 or 1. A classical search has to pick one record at a time to check it. In quantum computing, we can put our memory into a state where it is "exploring" all possible values simultaneously. This is called SuperpositionLike a spinning coin. While it spins, it's not just heads or tails—it's a blur of both at the same time. A quantum computer explores all these blurred possibilities at once.. If we have n bits, there are N = 2^n possible combinations. The state |A⟩ represents an equal superposition of all of them.
Real Life: Imagine looking for a specific friend in a dark crowded stadium. A classical computer checks one seat at a time with a tiny flashlight. A quantum computer turns on the stadium floodlights for a split second, lighting up every single seat at once.
A=1Nxx|A\rangle = \frac{1}{\sqrt{N}} \sum_x |x\rangle
Step 1 of 6
Bad States |A₀⟩Good States |A₁⟩|A⟩