Hangleiter, DominikDominikHangleiterKliesch, MartinMartinKlieschEisert, JensJensEisertGogolin, ChristianChristianGogolin2022-11-162022-11-162019-05-29Physical Review Letters 122 (21): 210502 (2019-05-29)http://hdl.handle.net/11420/14073Results on the hardness of approximate sampling are seen as important stepping stones toward a convincing demonstration of the superior computational power of quantum devices. The most prominent suggestions for such experiments include boson sampling, instantaneous quantum polynomial time (IQP) circuit sampling, and universal random circuit sampling. A key challenge for any such demonstration is to certify the correct implementation. For all these examples, and in fact for all sufficiently flat distributions, we show that any noninteractive certification from classical samples and a description of the target distribution requires exponentially many uses of the device. Our proofs rely on the same property that is a central ingredient for the approximate hardness results, namely, that the sampling distributions, as random variables depending on the random unitaries defining the problem instances, have small second moments.en0031-9007201921Journal Article10.1103/PhysRevLett.122.21050231283328Journal Article