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

We provide practical and powerful schemes for learning properties of a quantum state using
a small number of measurements. Specifically, we present a randomized measurement …

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 precise control of complex quantum systems promises numerous technological
applications including digital quantum computing. The complexity of such devices renders …

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 …

A crucial subroutine in quantum computing is to load the classical data of N complex
numbers into the amplitude of a superposed n=⌈ log 2 N⌉-qubit state. It has been proven …

We study the properties of output distributions of noisy random circuits. We obtain upper and
lower bounds on the expected distance of the output distribution from the “useless” uniform …

We consider quantum circuits consisting of randomly chosen two-local gates and study the
number of gates needed for the distribution over measurement outcomes for typical circuit …

Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a
non-programmable linear interferometer and threshold detectors on up to 144 output modes …