
Demonstration that a quantum computer can solve problems faster than classical supercomputers.Quantum supremacy is the milestone at which a quantum computer performs a calculation that is practically impossible for any classical supercomputer, regardless of how much time or resources are available. It is not about beating a classical machine in every task, but about demonstrating a clear, unambiguous advantage in a specific, well-defined problem. The concept is crucial because it provides the first experimental evidence that quantum mechanics can be harnessed for computation in a way that fundamentally outstrips classical physics.
The term was coined by John Preskill in 2012. The first claimed experimental demonstration was by Google's Sycamore processor in 2019, followed by the Chinese Jiuzhang photonic processor in 2020, with subsequent improvements like Jiuzhang 4.0.
The demonstration typically involves a carefully designed problem that is easy for a quantum processor to solve but exponentially hard for a classical one. For example, sampling the output distribution of a random quantum circuit or boson sampling with photons. The quantum computer runs the experiment and produces results; classical supercomputers are then challenged to reproduce the same results using the best-known algorithms. When the classical simulation time becomes astronomically large (e.g., thousands of years), while the quantum device finishes in minutes or hours, supremacy is claimed.
Beyond the benchmark itself, the techniques developed for supremacy experiments—such as verifying random quantum circuits—are used to validate quantum hardware and develop error-correction protocols.
The classical simulation of Google's 2019 supremacy experiment was later improved using a clever algorithm, reducing the estimated time from 10,000 years to a few days on a large cluster, showing that 'supremacy' is a moving target.
| K | variable | Leggett-Garg combination of correlation functions |
| C_{ab} | variable | Correlation function between measurements at times a and b — correlation function |
| C_{a'b} | variable | Correlation function between measurements at times a' and b — correlation function |
| C_{ab'} | variable | Correlation function between measurements at times a and b' — correlation function |
| C_{a'b'} | variable | Correlation function between measurements at times a' and b' — correlation function |




