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

During the last ten years, superconducting circuits have passed from being interesting
physical devices to becoming contenders for near-future useful and scalable quantum …

Suppressing errors is the central challenge for useful quantum computing, requiring
quantum error correction (QEC),,,–for large-scale processing. However, the overhead in the …

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 …

We study the problem of generating independent samples from the output distribution of
Google's Sycamore quantum circuits with a target fidelity, which is believed to be beyond the …

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 …

The continued development of computational approaches to many-body ground-state
problems in physics and chemistry calls for a consistent way to assess its overall progress …

The ability to perform measurements in the middle of a quantum circuit is a powerful
resource. It underlies a wide range of applications, from remote state preparation to quantum …

Gaussian boson sampling is a form of non-universal quantum computing that has been
considered a promising candidate for showing experimental quantum advantage. While …