Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Today's experimental noisy quantum processors can compete with and surpass all known
algorithms on state-of-the-art supercomputers for the computational benchmark task of …

Undesired coupling to the surrounding environment destroys long-range correlations on
quantum processors and hinders the coherent evolution in the nominally available …

We give a polynomial time classical algorithm for sampling from the output distribution of a
noisy random quantum circuit in the regime of anti-concentration to within inverse …

Demonstrating quantum advantage requires experimental implementation of a
computational task that is hard to achieve using state-of-the-art classical systems. One …

Photonics is a promising platform for demonstrating a quantum computational advantage
(QCA) by outperforming the most powerful classical supercomputers on a well-defined …

As Moore's law reaches its limits, quantum computers are emerging that hold promise to
dramatically outperform classical computers. It is now possible to build quantum processors …

A central question of quantum computing is determining the source of the advantage of
quantum computation over classical computation. Even though simulating quantum …

We study the distribution over measurement outcomes of noisy random quantum circuits in
the regime of low fidelity, which corresponds to the setting where the computation …

A central challenge in the verification of quantum computers is benchmarking their
performance as a whole and demonstrating their computational capabilities. In this Letter …