Quantum advantage
The point where a quantum computer solves a useful problem better than any classical machine; the headline claim diligence scrutinizes hardest.
Quantum advantage is the threshold at which a quantum computer performs a task beyond the reach of the best classical computers. The stronger phrase “quantum supremacy”, coined by John Preskill in 2012, usually refers to beating classical machines on a benchmark chosen to be hard for them, whether or not the task is useful; “practical” or “commercial” quantum advantage refers to outperforming on a problem with real economic value. The distinction is the whole game: a supremacy demonstration is a scientific milestone, a practical advantage is a business.
For an investor the term is a claim to be tested, because its credibility moves the valuation. The diligence questions are concrete. On what problem, and does anyone pay to solve that problem at that scale. Against which classical baseline, run by whom, with how much classical optimization effort (advantages have repeatedly evaporated when classical algorithms or hardware caught up). Reproduced independently, or asserted in a press release. At what resource cost, and does the advantage survive once error rates and overheads are included.
The honest framing a strong team uses is narrow and dated: advantage on this class of problem, against this baseline, expected at this scale by this time, with these assumptions. Vague claims of imminent, general advantage are the tell of either weak science or weak commercial understanding, and they invite exactly the scrutiny that collapses them. Treating quantum advantage as a roadmap target with conditions, rather than a slogan, is what separates a fundable claim from a red flag.
Quantum advantage is the claim most likely to be overstated in a deck and most likely to decide a deal, so a financial reader treats it as a claim to be qualified, not a fact. The two questions that defuse the hype: is the advantage on a contrived benchmark or on a problem someone will pay to solve, and has it been independently reproduced or only asserted. A claimed advantage that classical algorithms later erase is a recurring pattern, and the basis of more than one repricing.
From definition to decision
Model this in your own round, scenarios, dilution and runway, in the founder workspace.