2 problems

Quantum supremacy conjecture. There is no classical randomized algorithm that performs RCS to inverse-polynomial total variation-distance error.

Informal supremacy conjecture. Approximating to $1/\operatorname{poly}(n)$ multiplicative error most amplitudes of most quantum circuits is a $\#P$-hard problem.