Quantum Advantage: Proven, Believed, or Demonstrated?

Speaker

Yanbin Chen

Affiliation

TUM-I2

Type

Scientific Talk

Abstract

This talk preliminarily addresses what it really means to claim that quantum computers outperform classical computers. Starting from the relationship between BPP and BQP, it compares representative problems such as Grover search, Simon’s problem, factoring, quantum linear systems, and sampling tasks. It distinguishes proven, conditional, best-known, and experimentally demonstrated quantum advantages, before discussing why noise, hardware overhead, classical algorithm improvements, and verification make practical advantage difficult to establish.