Abstract
Quantum computation and quantum information have attracted considerable attention on multiple frontiers of scientific fields ranging from physics to chemistry and engineering, as well as from computer science to mathematics and statistics. It has been theoretically proved that quantum algorithms may provide for significant speedups over classical algorithms, but technological hurdles must be overcome to construct large-scale quantum computers for executing the quantum algorithms. Quantum (computational) supremacy refers to any major milestone quantum computing achievement in the quest for outperforming classical computers on some tough computational tasks. This talk will present recent quantum supremacy studies for solving hard statistical sampling problems and show that statistics plays a major role in the quantum supremacy studies.