Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 324 / 4 / i

The process is classically strongly efficiently simulatable if a deterministic classical algorithm can compute the probability of any specified $K$-bit output string to requested additive precision $2^{-m}$ in time polynomial in $n$, the circuit description, and $m$. This is strong classical simulation of a quantum circuit, and is stronger than merely sampling its output.