Grover's algorithm searches an unstructured database of N items in O(√N) queries — a quadratic speedup over classical brute force. For cryptographic key recovery, this means a 256-bit key requires roughly 2^128 quantum operations instead of 2^256 classical ones. The complexity is well known. What was missing: tight, implementation-agnostic bounds on the physical resources — energy, time, space — required to execute those operations.
The paper establishes a work-runtime trade-off for quantum search in autonomous quantum computers, deriving a fundamental lower bound that no implementation can violate. A specialized protocol achieves this bound, outperforming both circuit-based and adiabatic implementations while saturating the theoretical limit.
The striking consequence is cosmological. An 831-bit secret key cannot be recovered — not approximately, not in principle — by any quantum computer operating in a universe with dark energy and finite lifetime. The expansion of space dilutes the available energy; star formation ceases; the computation cannot complete before the universe dies. The key's security is not computational but thermodynamic. No algorithm, no hardware improvement, no future physics can circumvent it, because the constraint is the total work available in the observable universe.
Below 831 bits, security is algorithmic — it depends on how fast your computer runs. Above 831 bits, security is physical — it depends on the energy content of spacetime. The transition from computational to thermodynamic security is sharp, and the threshold is surprisingly low. The universe itself is the key space's ultimate upper bound.