Quantum Computational Advantage
2019Google's Sycamore processor completed a specific sampling task in ~200 seconds that the team estimated would take the best classical supercomputers thousands of years (Arute et al., 2019) -- the first empirical demonstration that a real quantum device can outperform classical computation on some task, answering a foundational question in computational complexity theory rather than delivering a commercial product. Basic-vs-Applied framing check: this node covers the scientific claim (a computational-complexity separation was empirically demonstrated), not the Sycamore chip itself or any commercial quantum-computing hardware, which have their own commercialization paths. The classical-hardness estimate was later disputed and narrowed by improved classical simulation algorithms -- a real, ongoing debate about the size of the advantage, not about whether the underlying experiment was performed.
Originators
- Frank Arute
- John Martinis
Landmark Paper
Checked 2026-08-30 — interim signal only, see docs/BASIC_ROADMAP.md Phase 10
Connections
- is application of Superconducting Qubitsbasis: reasoned
Google's 2019 demonstration was run on Sycamore, a 53-qubit programmable superconducting processor -- the paper's own title is "Quantum supremacy using a programmable superconducting processor" (Arute et al., Nature 574, 505-510, 2019). Distinct from the Josephson-junction edge already on this innovation (that one is theoretical grounding for the hardware itself, 1985); this one is a specific empirical application of the resulting superconducting-qubit platform to a computational-complexity question, not a step in the hardware's own origin story. The 10,000-year classical-hardness estimate was later disputed and narrowed by improved classical simulation algorithms -- noted in this Basic node's own description as an open, ongoing debate about the size of the advantage, not about whether the experiment itself was performed.