⚛️ Quantum Speed-up Calculator

Two numbers explain most headlines about quantum computing: how many states n qubits can describe, and how much faster a quantum search is. Change the inputs and watch them grow.

For example, every key of a lock, or every entry in an unsorted list.
States the qubits can describe (2^n)
-
Ordinary computer, average tries
-
Grover's algorithm, about
-
Fewer steps
-

What the numbers mean

Each extra qubit doubles the number of states a quantum computer can work with at once: 10 qubits describe 1,024 states, 50 describe over a quadrillion. That doubling is why a few hundred good qubits are a big deal.

For searching an unsorted list, an ordinary computer has to check on average half of the entries. Grover's algorithm needs about (π/4) × √N steps, the square root of the size. For a trillion possibilities that is roughly 785,000 steps instead of 500 billion.

What the numbers do not mean

Describing many states is not the same as reading out many answers: a measurement gives one result, and algorithms have to be designed to make the right one likely. Each quantum step is also far slower than an ordinary computer's step, and today's qubits make errors that need many extra qubits to correct. So a smaller step count does not yet mean a faster answer in practice; it shows how the advantage grows as problems get bigger.

Other tools you might need next

See all Developer Tools tools, or browse every free tool on the site.