---
title: But what is quantum computing? (Grover's Algorithm)
authors:
  - Grant Sanderson
abstract: null
summaryType: editorial
sourceStatus: Official lesson metadata and author animation source reviewed; video transcript and rendered frames not independently verified.
sources:
  - https://www.3blue1brown.com/lessons/grover
  - https://www.3blue1brown.com/lessons/grover/
  - https://www.youtube.com/watch?v=RQWpF2Gb-gU
  - https://github.com/3b1b/videos/blob/e5a041d2094ca8f11e0cabd20e9dd199b581e3f5/_2025/grover/state_vectors.py
---

# But what is quantum computing? (Grover's Algorithm)

## Editorial overview

Grant Sanderson’s 2025 3Blue1Brown lesson introduces qubits and quantum state vectors before developing Grover’s search algorithm.
The [official lesson page](https://www.3blue1brown.com/lessons/grover/) dates it to April 29, 2025.
This gallery entry provides an editorial account of its geometric construction for readers interested in how visualization explains an algorithm.

## Visualization mechanism

The construction uses a plane whose vertical axis represents the target basis state and whose horizontal axis represents the normalized uniform combination of unmarked states.
The initial uniform state over all $N$ candidates lies between these directions, with target amplitude $1/\sqrt{N}$ for a single target.
One reflection reverses that target component; the next reflects the vector about the initial uniform-state direction.
Together they rotate the state by $2\theta$, where $\sin\theta=1/\sqrt{N}$.

In this editorial mathematical interpretation, the geometry represents amplitudes, while measurement probabilities are their squared magnitudes.
A sign reversal alone therefore leaves measurement probabilities unchanged.
The paired transformations move the state toward the target direction, increasing its measurement probability until an appropriate stopping point.
The plane describes this restricted search trajectory, not arbitrary multi-qubit states.

## What users learn

The construction connects amplitude amplification to repeated rotations and approximately $\pi\sqrt{N}/4$ iterations for one target.
It foregrounds algorithmic state geometry rather than a circuit’s gate sequence.
These are explanatory opportunities afforded by the representation; this entry does not claim measured learning gains.

## Scope and sources

The description above was checked against the official lesson metadata and the author’s [animation source](https://github.com/3b1b/videos/blob/e5a041d2094ca8f11e0cabd20e9dd199b581e3f5/_2025/grover/state_vectors.py#L2266).
The [published video](https://www.youtube.com/watch?v=RQWpF2Gb-gU) is the work being summarized, but its transcript and rendered frames were not independently verified for this entry.
Consequently, the account covers the documented geometric construction without asserting details of the final edit, narration, or viewer interaction.
This is an editorial summary, not an original scholarly abstract.