walk 01 · april 2026
How long would a quantum computer take to find the best possible life you could live?
Seventy forks, about five options at each: a toy model with 8.5 × 10⁴⁸ possible lives in it. Check one per nanosecond and you finish in 2.7 × 10³² years, twenty billion trillion times the age of the universe. Grover's algorithm takes the square root and gets you to 2.9 × 10²⁴ queries, about 92 million years. Then the walk stops asking for the best life and asks for a good one, and the arithmetic collapses to 343 microseconds.
Open story

