N* ≈
Unlocked
Classical T(N) Quantum T(N) Crossover N* Target size density

Quantum Advantage Crossover: Market Unlock Simulator (2D)

The same crossover question the 3D roadmap version animates over time, computed here as a pure scaling-curve intersection. Two runtime formulas are evaluated as functions of problem size N — a classical algorithm with either exponential or linear scaling, and a quantum algorithm with either polynomial or square-root scaling — and a real bisection root-finder locates the exact N where the quantum curve, despite its larger constant-factor overhead, becomes faster than the classical one. Everything above that size is where quantum computing pays off economically; set a log-normal distribution of real-world problem sizes and read off what share of that market sits above the line.