Grover's Search Complexity
Number of queries needed by Grover's algorithm to find an item in an unsorted database of N entries.
Formula
Variables
Example
N = 1 000 000 → ≈ 1 000 queries instead of 500 000
Did You Know?
Grover's algorithm gives a quadratic speed-up — not exponential — but for huge databases even that is game-changing.
Share this formula
More in Quantum Computing
View allQubit Superposition State
IntermediateGeneral state of a single qubit as a superposition of the computational basis states.
Normalisation Constraint
BasicThe squared amplitudes of a qubit must sum to 1, ensuring total probability is 100 %.
Hadamard Gate
IntermediatePuts a qubit into an equal superposition — the most common single-qubit gate.
Pauli-X Gate (Quantum NOT)
BasicFlips |0⟩ to |1⟩ and vice versa — the quantum equivalent of a classical NOT gate.
CNOT Gate
IntermediateTwo-qubit gate that flips the target qubit only when the control qubit is |1⟩.
Bell State (EPR Pair)
IntermediateMaximally entangled two-qubit state — measuring one qubit instantly determines the other.